Talk:State space search
This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
Optimal?
[edit]From the article:
- In game-playing, the minimax algorithm is the optimal form of such heuristic search.
Uh, really? Optimal in what sense? It's true that if you explore the entire tree, then minimax will find the best strategy playing against a perfect opponent. But that's just correctness, not optimality. When there are heuristics involved (as in this article), I don't see how there can be any formal concept of optimal, and I doubt that minimax meets even informal ones. Brighterorange 18:10, 2 September 2005 (UTC)
Bibliography
[edit]I would just like to correct : Artificial Intelligence : A Modern Approach was edited in 1995 and not in 2003 as mentioned (or maybe a second edition ?).
Advantages
[edit]How is "It is widely used in artificial intelligence" an advantage of this search algorithm? —Preceding unsigned comment added by 129.215.149.97 (talk) 10:55, 17 May 2010 (UTC)