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

DOI10.1016/0168-9274(93)90123-9zbMATH Open0798.68154OpenAlexW2093621166MaRDI QIDQ1802661FDOQ1802661

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

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

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)

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
• Title not available (Why is that?)
• Material symmetry to partition endgame tables
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)