Solving breakthrough with Race Patterns and Job-Level Proof Number Search

Thumbnail
View/Open
Date
2012
Dewey
Intelligence artificielle
Sujet
Breakthrough; Board game
Conference name
13th International Conference on Advances in Computer Games, ACG 2011
Conference date
11-2011
Conference city
Tilburg
Conference country
Netherlands
Book title
Advances in Computer Games 13th International Conference, ACG 2011, Tilburg, The Netherlands, November 20-22, 2011, Revised Selected Papers
Author
Van den Herik, H. Jaap
Publisher
Springer
Publisher city
Berlin Heidelberg
Year
2012
ISBN
978-3-642-31865-8
URI
https://basepub.dauphine.fr/handle/123456789/11642
Collections
Metadata
Show full item record
Author
Cazenave, Tristan
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Jouandeau, Nicolas
104738 Laboratoire d'Informatique Avancée de Saint-Denis [LIASD]
Saffidine, Abdallah
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Communication / Conférence
Item number of pages
356
Abstract (EN)
breakthrough is a recent race-based board game usually played on a 8×8 board. We describe a method to solve 6×5 boards based on (1) race patterns and (2) an extension of (JLPNS).Using race patterns is a new domain-specific technique that allows early endgame detection. The patterns we use enable us to prune positions safely and statically as far as 7 moves from the end.For the purpose of solving Breakthrough we also present an extension of the parallel algorithm (JLPNS), viz. when a PN search is used as the underlying job. In this extension, partial results are regularly sent by the clients to the server.