Breakthrough (Game)

From Chessprogramming wiki
Jump to: navigation, search

Home * Games * Breakthrough (Game)

Breakthrough,
an abstract strategy board game invented by Dan Troyka in 2000 [1] [2]. It can be played on various board sizes, most common on an 8x8 chessboard with initially 16 pawn like counters on its two back ranks. Counters may push one step straight or diagonally forward if the target square is empty, or capture one step diagonally if the target square is occupied by an opponent piece. The first player to reach the opponent's back rank or captures all opponent men wins the game [3].

Solving Small Boards

Abdallah Saffidine, Nicolas Jouandeau, and Tristan Cazenave applied race patterns and an extension of Job-level Proof-number search to solve Breakthrough on up to 6x5 boards [4].

Breakthrough5x5.jpg

Programming

As introduced at the Computer and Games 2013 conference in Yokohama, Richard J. Lorentz and Therese Horey used a hybrid version of Monte-Carlo Tree Search for Breakthrough [5]. Playouts are not complete games but fragments where a reliable evaluation function can be used at the stopping points [6].

Computer Olympiads

See also

Selected Publications

External Links

References

  1. William Daniel Troyka - Mancala World
  2. Breakthrough (board game) from Wikipedia
  3. Image from Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13 - Fig. 1: Rules for the game
  4. Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13, pdf
  5. Richard J. Lorentz, Therese Horey (2013). Programming Breakthrough. CG 2013
  6. Ingo Althöfer (2013). The wild Years are gone: Monte Carlo in Smoother Waters. Conference Report CG 2013, ICGA Journal, Vol. 36, No. 3
  7. Appandix A. The Rules of Breakthrough - in Game Description Language

Up one Level