When is it better not to look ahead?

DOI10.1016/J.ARTINT.2010.08.002MaRDI QIDQ622121zbMATH OpenOpenAlexFDO

Authors Dana S. Nau, Mitja Luštrek, Austin Parker, Ivan Bratko, Matjaž Gams

Publication date 31 January 2011

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2010.08.002

zbMATH Keywords

minimaxgame-tree searchlookahead pathology

Mathematics Subject Classification ID

Decision theory for games (91A35)

Recommendations

• On look-ahead and pathology in decision tree learning
• A theoretical examination of practical game playing: lookahead search
• Limited lookahead in imperfect-information games
• On game graph structure and its influence on pathology
• Bias and pathology in minimax search

Cites work

• scientific article; zbMATH DE number 3063363 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• An analysis of alpha-beta pruning
• An investigation of the causes of pathology in games
• Benefits of using multivalued functions for minimaxing
• Bias and pathology in minimax search
• Checkers is solved
• Deep Blue
• Is real-valued minimax pathological?
• On game graph structure and its influence on pathology
• On the nature of pathology in game searching
• Pathology on game trees revisited, and an alternative to minimaxing
• Real-time heuristic search

Cited in

(6)

• Limited lookahead in imperfect-information games
• Independent-valued minimax: Pathological or beneficial?
• Don't look now
• On look-ahead and pathology in decision tree learning
• A theoretical examination of practical game playing: lookahead search
• Effect of look-ahead depth in evolutionary checkers

This page was built for publication: When is it better not to look ahead?

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