Advances in Computer Games

“EinStein würfelt nicht!” is a simple board game, played usually on a 5 × 5 board with 6 stones per player and a die. In this research, we study the game in the particular case when the players start with only one stone. In that case the random element from the use of a die disappears, so that an analytical analysis is possible. We describe and prove a winning strategy for the first (or second) player for all possible board sizes. In most cases, the first player can force a win, but somewhat surprisingly, depending on a precisely formulated condition on the board size, it is sometimes possible for the second player to win.

[1]  Tomoyuki Kaneko.  Parallel Depth First Proof Number Search , 2010, AAAI.

[2]  David A. McAllester.  Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..

[3]  I-Chen Wu,et al.  Relevance-Zone-Oriented Proof Search for Connect6 , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[4]  Monty Newborn,et al.  A Hypothesis concerning the Strength of Chess Programs , 1985, J. Int. Comput. Games Assoc..

[5]  Ivan Bratko,et al.  Computer Analysis of World Chess Champions , 2006, J. Int. Comput. Games Assoc..

[6]  長井 歩,et al.  Df-pn algorithm for searching AND/OR trees and its applications , 2002 .

[7]  H. Jaap van den Herik,et al.  Games solved: Now and in the future , 2002, Artif. Intell..

[8]  Ivan Bratko,et al.  Factors Affecting Diminishing Returns for Searching Deeper , 2007, J. Int. Comput. Games Assoc..

[9]  Akihiro Kishimoto.  Correct and efficient search algorithms in the presence of repetitions , 2005 .

[10]  Akihiro Kishimoto,et al.  Game-Tree Search Using Proof Numbers: The First Twenty Years , 2012, J. Int. Comput. Games Assoc..

[11]  Jakub Pawlewicz.  Improving Depth-first PN-Search : 1 + ε Trick , 2006 .

[12]  H. Jaap van den Herik,et al.  Proof-Number Search , 1994, Artif. Intell..

[13]  H. Jaap van den Herik,et al.  Proof-Number Search and Its Variants , 2008, Oppositional Concepts in Computational Intelligence.

[14]  Ivan Bratko,et al.  HOW TRUSTWORTHY IS CRAFTY’S ANALYSIS OF WORLD CHESS CHAMPIONS? , 2008 .

[15]  Yuichi Fujiki,et al.  O job can you return my mojo: improving human engagement and enjoyment in routine activities , 2010, CHI.

[16]  I. Bratko,et al.  Detecting Fortresses in Chess , 2012 .

[17]  Akihiro Kishimoto,et al.  Search versus Knowledge for Solving Life and Death Problems in Go , 2005, AAAI.

[18]  Ivan Bratko,et al.  Using Heuristic-Search Based Engines for Estimating Human Skill at Chess , 2011, J. Int. Comput. Games Assoc..

[19]  I-Chen Wu,et al.  A New Family of k-in-a-Row Games , 2006, ACG.