Course:Pyramid Stacking
| Guidelines | Create Your Wiki Page | Past Projects | Help and Resources |
| Course title | |
|---|---|
 | |
| Course title | |
| Instructor: | |
| Email: | |
| Office: | |
| Office Hours: | |
| Class Schedule: | |
| Important Course Pages | |
Pyramid Stacking
Authors: Perry Liao, Laura Rodgers
What is the problem?
A game where each player is given a set deck, and they try to exhaust their deck as quickly as possible to win.
What is the something extra?
A non-trivial AI opponent(s) to play against the player.
What did we learn from doing this?
- advanced algorithms involving trees
- how to actually make a game in haskell in practise
- creating an interesting AI opponent