Heuristic search in artificial intelligence


In February of this year, Claude E. Shannon and Herbert A. Simon passed away, both at age 84. In his 1950 paper entitled, “Programming a Computer to Play Chess” [3], Shannon laid out the theory of minimax search with bounded lookahead and static heuristic evaluation, the basis of almost all subsequent work on two-player games. Along with Allen Newell… (More)
DOI: 10.1016/S0004-3702(01)00111-4


  • Presentations referencing similar topics