Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

When is it better not to look ahead?

From MaRDI portal
Publication:622121
Jump to:navigation, search

DOI10.1016/j.artint.2010.08.002zbMath1237.91047OpenAlexW2120620770MaRDI QIDQ622121

Ivan Bratko, Austin Parker, Dana S. Nau, Mitja Luštrek, Matjaz 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)


Related Items (3)

Effect of look-ahead depth in evolutionary checkers ⋮ Independent-valued minimax: Pathological or beneficial? ⋮ Limited lookahead in imperfect-information games



Cites Work

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


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:622121&oldid=12515253"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 08:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki