|
|
| Line 100: |
Line 100: |
| ==Code Structure Plan== | | ==Code Structure Plan== |
|
| |
|
| Update: 2/25/2010, as of this date we have our latest up to date code structure with comments and modules on the following website [http://people.rit.edu/yah3133/ http://people.rit.edu/yah3133/] | | Update: 11/16/2010, Current documentation is located at [http://mikekitson.com/pacmath/ http://mikekitson.com/pacmath/] |
| | |
| We will be using a mix and match of two existing classic arcade games implemented in Python.
| |
| The first one is from [http://www-inst.eecs.berkeley.edu/~cs188/fa07/projects/search/searchproject.html Berkeley.edu] and it is a very simple implementation. The second game comes from [http://pinproject.com/pacman/pacman.htm PyGames] and it is more complicated in its design and implementation. We will be using a bit of both to try to come up with an optimal one that would work at a good speed in the XO.
| |
|
| |
|
| | Update: <s>2/25/2010, as of this date we have our latest up to date code structure with comments and modules on the following website [http://people.rit.edu/yah3133/ http://people.rit.edu/yah3133/]</s> |
|
| |
|
| | Components: |
| *Question generation | | *Question generation |
| *Mazes | | *Mazes |