Knowledge Abstraction in Chinese Chess Endgame Databases

DOI10.1007/978-3-642-17928-0_17MaRDI QIDQ3073761zbMATH OpenOpenAlexFDO

Authors Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu

Publication date 11 February 2011

Published in Computers and Games (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17928-0_17

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46) Experimental studies (91A90)

Recommendations

• Solving Chinese chess endgames by database construction
• scientific article; zbMATH DE number 1759678
• Learning long-term chess strategies from databases
• Bits and pieces: Constructing chess endgame databases on parallel and vector architectures

Cited in

(6)

• Solving Chinese chess endgames by database construction
• Bits and pieces: Constructing chess endgame databases on parallel and vector architectures
• Learning long-term chess strategies from databases
• scientific article; zbMATH DE number 4080975 (Why is no real title available?)
• scientific article; zbMATH DE number 1759678 (Why is no real title available?)
• Playing the perfect Kriegspiel endgame

This page was built for publication: Knowledge Abstraction in Chinese Chess Endgame Databases

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