Solving breakthrough with Race Patterns and Job-Level Proof Number Search - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

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

Résumé

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.

Mots clés

Fichier principal
Vignette du fichier
solving.pdf (279.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01499675 , version 1 (31-03-2017)

Identifiants

  • HAL Id : hal-01499675 , version 1

Citer

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⟩
118 Consultations
202 Téléchargements

Partager

Gmail Facebook X LinkedIn More