Puzzle/Game Algorithms
A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: closed (15 March 2012) | Viewed by 56231
Special Issue Editor
Interests: computational complexity; graph theory; algorithms
Special Issues, Collections and Topics in MDPI journals
Special Issue Information
Dear Colleagues,
In the society of theoretical computer science, games and puzzles have been widely investigated since they sometimes require deep insight from the viewpoint of mathematics. From the viewpoint of computation, John Conway’s Game of Life plays an important role as a computation model, and the pebble games are used to formulate the computational complexity classes. On the other hand, from the viewpoint of algorithms, combinatorial game theory has also been in fashion since Bouton’s analysis of the game of Nim, more than one hundred years ago. This special issue will focus on research papers that describe puzzle/game algorithms. The topics include, but not limited to:
- algorithms for generating puzzle instances
- algorithms for solving games/puzzles
- computational complexity of games/puzzles
- mathematical analysis of games/puzzles
- recreational mathmatics
- winning strategies of games/puzzles
Prof. Dr. Ryuhei Uehara
Guest Editor
Keywords
- combinatorial game theory
- recreational mathematics
- computational complexity of games/puzzles
- algorithms for games/puzzles
- mathematics in games/puzzles