Bits and pieces: Constructing chess endgame databases on parallel and vector architectures

DOI10.1016/0168-9274(93)90123-9MaRDI QIDQ1802661zbMATH OpenOpenAlexFDO

Authors Burton Wendroff, Tony Warnock, Lewis Stiller, Dean Mayer, Ralph G. Brickner

Publication date 31 October 1994

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://zenodo.org/record/1258409

zbMATH Keywords

chessparallel computingbacktrackingvector computerendgame database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) 2-person games (91A05) Mathematical problems of computer architecture (68M07)

Recommendations

• Solving Chinese chess endgames by database construction
• scientific article; zbMATH DE number 1759678
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• Knowledge Abstraction in Chinese Chess Endgame Databases
• Learning long-term chess strategies from databases

Cites work

• Group graphs and computational symmetry on massively parallel architecture

Cited in

(9)

• Learning long-term chess strategies from databases
• Using partial tablebases in Breakthrough
• Solving Chinese chess endgames by database construction
• Knowledge Abstraction in Chinese Chess Endgame Databases
• scientific article; zbMATH DE number 5642148 (Why is no real title available?)
• Material symmetry to partition endgame tables
• scientific article; zbMATH DE number 1759678 (Why is no real title available?)
• scientific article; zbMATH DE number 4080975 (Why is no real title available?)
• An alternative efficient chessboard representation based on 4-bit piece coding

This page was built for publication: Bits and pieces: Constructing chess endgame databases on parallel and vector architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802661)