Special Issue "Puzzle/Game Algorithms"

Quicklinks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (15 March 2012)

Special Issue Editor

Guest Editor
Prof. Dr. Ryuhei Uehara
School of Information Science (JAIST), 1-1 Asahidai, Nomi, Ishikawa, 923-1292 Japan
Website: http://www.jaist.ac.jp/~uehara
E-Mail: uehara@jaist.ac.jp
Phone: +81 761 51 1111
Fax: +81 761 51 1149
Interests: computational complexity; graph theory; 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

Published Papers (6 papers)

by
Algorithms 2012, 5(2), 273-288; doi:10.3390/a5020273
Received: 16 November 2011; in revised form: 15 April 2012 / Accepted: 8 May 2012 / Published: 9 May 2012
Show/Hide Abstract | PDF Full-text (4034 KB)

by ,  and
Algorithms 2012, 5(2), 261-272; doi:10.3390/a5020261
Received: 11 November 2011; in revised form: 27 February 2012 / Accepted: 7 April 2012 / Published: 13 April 2012
Show/Hide Abstract | PDF Full-text (117 KB)

by , , , ,  and
Algorithms 2012, 5(2), 176-213; doi:10.3390/a5020176
Received: 16 November 2011; in revised form: 29 February 2012 / Accepted: 19 March 2012 / Published: 5 April 2012
Show/Hide Abstract | PDF Full-text (298 KB)

by  and
Algorithms 2012, 5(1), 158-175; doi:10.3390/a5010158
Received: 15 December 2011; in revised form: 9 March 2012 / Accepted: 14 March 2012 / Published: 22 March 2012
Show/Hide Abstract | PDF Full-text (6813 KB)

by ,  and
Algorithms 2012, 5(1), 148-157; doi:10.3390/a5010148
Received: 15 November 2011; in revised form: 13 March 2012 / Accepted: 14 March 2012 / Published: 19 March 2012
Show/Hide Abstract | Cited by 1 | PDF Full-text (2190 KB)

by , , , , , ,  and
Algorithms 2012, 5(1), 18-29; doi:10.3390/a5010018
Received: 27 December 2011; in revised form: 30 December 2011 / Accepted: 30 December 2011 / Published: 13 January 2012
Show/Hide Abstract | PDF Full-text (191 KB)

Last update: 20 February 2014

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert