Learning long-term chess strategies from databases
From MaRDI portal
Recommendations
- Knowledge Abstraction in Chinese Chess Endgame Databases
- Solving Chinese chess endgames by database construction
- Bits and pieces: Constructing chess endgame databases on parallel and vector architectures
- scientific article; zbMATH DE number 1759678
- A combinatorial game mathematical strategy planning procedure for a class of chess endgames
Cites work
Cited in
(8)- Solving Chinese chess endgames by database construction
- Knowledge Abstraction in Chinese Chess Endgame Databases
- scientific article; zbMATH DE number 67853 (Why is no real title available?)
- scientific article; zbMATH DE number 4080976 (Why is no real title available?)
- Bits and pieces: Constructing chess endgame databases on parallel and vector architectures
- scientific article; zbMATH DE number 1759680 (Why is no real title available?)
- scientific article; zbMATH DE number 1759678 (Why is no real title available?)
- scientific article; zbMATH DE number 4080975 (Why is no real title available?)
This page was built for publication: Learning long-term chess strategies from databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433173)