Difference between revisions of "Breakthrough (Game)"
GerdIsenberg (talk | contribs) (Created page with "'''Home * Games * Breakthrough (Game)''' '''Breakthrough''',<br/> an [https://en.wikipedia.org/wiki/Abstract_strategy abstract strategy] board game invented...") |
GerdIsenberg (talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 5: | Line 5: | ||
=Solving Small Boards= | =Solving Small Boards= | ||
| − | [[Abdallah Saffidine]], [[Nicolas Jouandeau]], and [[Tristan Cazenave]] applied race patterns and an extension of [[Proof- | + | [[Abdallah Saffidine]], [[Nicolas Jouandeau]], and [[Tristan Cazenave]] applied race patterns and an extension of [[Proof-Number Search|Job-level Proof-number search]] to solve Breakthrough on up to '''6x5''' boards <ref>[[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2011'''). ''Solving breakthrough with Race Patterns and Job-Level Proof Number Search''. [[Advances in Computer Games 13]], [http://www.lamsade.dauphine.fr/~cazenave/papers/solving.pdf pdf]</ref>. |
[[FILE:Breakthrough5x5.jpg|none|border|text-bottom]] | [[FILE:Breakthrough5x5.jpg|none|border|text-bottom]] | ||
| Line 19: | Line 19: | ||
* [[Monte-Carlo Tree Search]] | * [[Monte-Carlo Tree Search]] | ||
* [[Pawns Breakthrough]] | * [[Pawns Breakthrough]] | ||
| − | * [[Proof- | + | * [[Proof-Number Search]] |
=Selected Publications= | =Selected Publications= | ||
| Line 27: | Line 27: | ||
* [[Richard J. Lorentz]], [[Andrew Isaac]] ('''2016'''). ''Using Partial Tablebases in Breakthrough''. [[CG 2016]] | * [[Richard J. Lorentz]], [[Andrew Isaac]] ('''2016'''). ''Using Partial Tablebases in Breakthrough''. [[CG 2016]] | ||
* [[Richard J. Lorentz]] ('''2017'''). ''Machine Learning in the Game of Breakthrough''. [[Advances in Computer Games 15]] | * [[Richard J. Lorentz]] ('''2017'''). ''Machine Learning in the Game of Breakthrough''. [[Advances in Computer Games 15]] | ||
| + | * [[Richard J. Lorentz]] ('''2017'''). ''Wanderer wins Breakthrough tournament''. [[ICGA Journal#39_34|ICGA Journal, Vol. 39, Nos. 3-4]] » [[20th Computer Olympiad#Breakthrough|20th Computer Olympiad 2017]] | ||
=External Links= | =External Links= | ||
Latest revision as of 21:54, 27 May 2018
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].
Contents
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].
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
- BreakThrough (Chess Program)
- Monte-Carlo Tree Search
- Pawns Breakthrough
- Proof-Number Search
Selected Publications
- Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13, pdf
- Stephan Schiffel (2011). Knowledge-Based General Game Playing. Ph.D. thesis, Dresden University of Technology, advisor Michael Thielscher and Yngvi Björnsson, pdf [7]
- Richard J. Lorentz, Therese Horey (2013). Programming Breakthrough. CG 2013
- Richard J. Lorentz, Andrew Isaac (2016). Using Partial Tablebases in Breakthrough. CG 2016
- Richard J. Lorentz (2017). Machine Learning in the Game of Breakthrough. Advances in Computer Games 15
- Richard J. Lorentz (2017). Wanderer wins Breakthrough tournament. ICGA Journal, Vol. 39, Nos. 3-4 » 20th Computer Olympiad 2017
External Links
- Breakthrough (board game) from Wikipedia
- Interesting games - MindSports
- Breakthrough - Free 8x8 Board Game - By Dan Troyka - about.com
- Little Golem - online board games - Breakthrough
References
- ↑ William Daniel Troyka - Mancala World
- ↑ Breakthrough (board game) from Wikipedia
- ↑ 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
- ↑ Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13, pdf
- ↑ Richard J. Lorentz, Therese Horey (2013). Programming Breakthrough. CG 2013
- ↑ Ingo Althöfer (2013). The wild Years are gone: Monte Carlo in Smoother Waters. Conference Report CG 2013, ICGA Journal, Vol. 36, No. 3
- ↑ Appandix A. The Rules of Breakthrough - in Game Description Language
