Using Partial Tablebases in Breakthrough
| Autor: | Richard J. Lorentz, Andrew Isaac |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
010201 computation theory & mathematics Computer science Endgame tablebase 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0102 computer and information sciences 02 engineering and technology Construct (python library) Chess endgame 01 natural sciences |
| Zdroj: | Computers and Games ISBN: 9783319509341 Computers and Games |
| DOI: | 10.1007/978-3-319-50935-8_1 |
| Popis: | In the game of Breakthrough the endgame is reached when there are still many pieces on the board. This means there are too many possible positions to be able to construct a reasonable endgame tablebase on the standard 8 \(\times \) 8 board, or even on a 6 \(\times \) 6 board. The fact that Breakthrough pieces only move forward allows us to create partial tablebases on the last n rows of each side of the board. We show how doing this enables us to create a much stronger MCTS based 6 \(\times \) 6 player and allows us to solve positions that would otherwise be out of reach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|