From my old spectrum days, programming a pac man maze involved a simple data structure (could be done with an array) - Quick example:
Data 1,1,1,1,1,1,1,1,1
Data 1,2,0,1,0,0,0,2,1
Data 1,1,0,0,0,1,0,1,1
Data 1,1,1,1,0,0,0,0,1
Data 1,0,1,0,0,1,1,0,1
Data 1,0,1,0,1,1,0,0,1
Data 1,0,0,0,1,0,0,1,1
Data 1,1,1,0,0,0,1,1,1
Data 1,2,0,0,1,0,0,2,1
Data 1,1,1,1,1,1,1,1,1
Where:
1 = Wall
0 = Dot (Space)
2 = Power Pill
Although now such data banks can be loaded in from files and created much simpler using spreadsheet software etc.
Data 1,1,1,1,1,1,1,1,1
Data 1,2,0,1,0,0,0,2,1
Data 1,1,0,0,0,1,0,1,1
Data 1,1,1,1,0,0,0,0,1
Data 1,0,1,0,0,1,1,0,1
Data 1,0,1,0,1,1,0,0,1
Data 1,0,0,0,1,0,0,1,1
Data 1,1,1,0,0,0,1,1,1
Data 1,2,0,0,1,0,0,2,1
Data 1,1,1,1,1,1,1,1,1
Where:
1 = Wall
0 = Dot (Space)
2 = Power Pill
Although now such data banks can be loaded in from files and created much simpler using spreadsheet software etc.