A program for progressive chess

DOI10.1016/J.TCS.2016.06.028MaRDI QIDQ307784zbMATH OpenOpenAlexFDO

Authors Vito Janko, Matej Guid

Publication date 5 September 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.06.028

zbMATH Keywords

heuristicschessheuristic searchA* algorithmcheckmate searchcombinatorial complexityminimax searchprogressive chess

Mathematics Subject Classification ID

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

Recommendations

• Using patterns and plans in chess
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• scientific article; zbMATH DE number 862676
• scientific article; zbMATH DE number 40992
• AN IMPROVER OF CHESS PROBLEMS

Cites work

• Is real-valued minimax pathological?

Cited in

(2)

• Double moves by each player in chess openings make the game fairer
• Realization of the chess mate solver application

This page was built for publication: A program for progressive chess

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