Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01499675
Contributor : Christine Okret-Manville <>
Submitted on : Friday, March 31, 2017 - 6:29:46 PM
Last modification on : Monday, August 3, 2020 - 3:36:04 AM
Document(s) archivé(s) le : Saturday, July 1, 2017 - 3:45:42 PM

File

solving.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01499675, version 1

Citation

Tristan Cazenave, Nicolas Jouandeau, Abdallah Saffidine. Solving breakthrough with Race Patterns and Job-Level Proof Number Search. 13th International Conference on Advances in Computer Games (ACG 2011), Nov 2011, Tilburg, Netherlands. pp.196-207. ⟨hal-01499675⟩

Share

Metrics

Record views

164

Files downloads

244