The algorithmics of solitaire-like games
One-person solitaire-like games are explored with a view to using them in teaching algorithmic problem solving. The key to understanding solutions to such games is the identification of invariant properties of polynomial arithmetic. We demonstrate this via three case studies: solitaire itself, tilin...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Elsevier
2012
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/1854/ |