You are currently viewing a new version of our website. To view the old version click .

Puzzle/Game Algorithms

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

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Published Papers