Extended Null-Move Reductions

DOI10.1007/978-3-540-87608-3_19MaRDI QIDQ3601834zbMATH OpenOpenAlexFDO

Authors Omid David-Tabibi, Nathan S. Netanyahu

Publication date 12 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-87608-3_19

Mathematics Subject Classification ID

Experimental studies (91A90)

Recommendations

• Multi-cut -pruning in game-tree search
• scientific article; zbMATH DE number 1927212
• Best-first fixed-depth minimax algorithms
• scientific article; zbMATH DE number 67462
• An analysis of the full alpha-beta pruning algorithm

Cites work

• A comparison of minimax tree search algorithms
• scientific article; zbMATH DE number 43377 (Why is no real title available?)
• scientific article; zbMATH DE number 48544 (Why is no real title available?)
• scientific article; zbMATH DE number 3532502 (Why is no real title available?)
• scientific article; zbMATH DE number 3407146 (Why is no real title available?)
• Multi-cut -pruning in game-tree search
• The technology chess program

Cited in

(1)

• An algorithm for the detection of move repetition without the use of hash-keys

This page was built for publication: Extended Null-Move Reductions

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