Chess endgames: 6-man data and strategy

Authors:
M. S. Bourzutschky;J. A. Tamplin;G. Mc. C. Haworth
Affiliations:
School of Systems Engineering and Computer Science, University of Reading, UK;School of Systems Engineering and Computer Science, University of Reading, UK;School of Systems Engineering and Computer Science, University of Reading, UK
Venue:
Theoretical Computer Science - Advances in computer games
Year:
2005

Citing 1
Cited 2

Expert against Oracle

Machine intelligence 11

Evolution of an efficient search algorithm for the mate-in-N problem in chess

EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Data assurance in opaque computations

ACG'09 Proceedings of the 12th international conference on Advances in Computer Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm that determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm recursively searches the game-tree, combining fixed and dynamic game-state virtual connection ...