When is it better not to look ahead?

DOI10.1016/J.ARTINT.2010.08.002zbMATH Open1237.91047OpenAlexW2120620770MaRDI QIDQ622121

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Real-time heuristic search
• Checkers Is Solved
• Deep Blue
• An analysis of alpha-beta pruning
• Is real-valued minimax pathological?
• Benefits of using multivalued functions for minimaxing
• An investigation of the causes of pathology in games
• Pathology on game trees revisited, and an alternative to minimaxing
• On the nature of pathology in game searching
• Bias and pathology in minimax search
• On game graph structure and its influence on pathology

Cited In (3)

• Limited lookahead in imperfect-information games
• Independent-valued minimax: Pathological or beneficial?
• 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)