Changes

Independently, pathology in game trees was coined by [[Dana S. Nau]], who discovered pathology to exist in a large class of games <ref>[[Dana S. Nau]] ('''1982'''). ''An Investigation of the Causes of Pathology in Games.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 19, 257–278, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park], Recommended by [[Judea Pearl]], [http://www.cs.umd.edu/%7Enau/papers/nau82investigation.pdf pdf]</ref> under the assumption of independence of sibling values of trees with low branching factor (i.e. binary trees) with game theoretic leaf values of win and loss {1, -1}. In a simulation, Nau introduced strong dependencies between sibling nodes and discovered that this can cause search-depth pathology to disappear. While Nau was primarily concerned with decision accuracy, Beal <ref>[[Don Beal]] ('''1982'''). ''Benefits of minimax search''. [[Advances in Computer Chess 3]]</ref>, as well as [[Ivan Bratko|Bratko]] and [[Matjaž Gams|Gams]] <ref>[[Ivan Bratko]], [[Matjaž Gams]] ('''1982'''). ''Error Analysis of the Minimax Principle''. [[Advances in Computer Chess 3]]</ref> were concerned with evaluation accuracy.

Quite contrary to pathology in chess, Beal and others demonstrated <ref>[[Don Beal]], [[Martin C. Smith]] ('''1994'''). ''Random Evaluations in Chess''. [[ICGA Journal#17_1|ICCA Journal, Vol. 17, No. 1]]</ref>, that deeper [[Search with Random Leaf Values|search with random leaf values]] yields to better play. As a quintessence, [[Dana S. Nau]] et al. suggested an ''Error minimizing minimax search'' in their recent paper <ref>[[Brandon Wilson]], [[Austin Parker]], [[Dana S. Nau]] ('''2009'''). ''Error Minimizing Minimax: Avoiding Search Pathology in Game Trees''. [http://www.cs.umd.edu/~nau/papers/wilson2009error.pdf pdf]</ref> .

* [[Dana S. Nau]] ('''1979'''). ''Quality of Decision Versus Depth of Search on Game Trees.'' Ph.D. dissertation, [[Duke University]]* [[Dana S. Nau]] ('''1979'''). ''Preliminary results regarding quality of play versus depth of search in game playing.'' First Internat. Symposium on Policy Analysis and Information Systems, pp. 210–217, [http://www.cs.umd.edu/%7Enau/papers/nau79preliminary.pdf pdf]

* [[Dana S. Nau]] ('''1980'''). ''Pathology on game trees: A summary of results.'' In Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 102–104, [http://www.cs.umd.edu/%7Enau/papers/pathology-aaai80.pdf pdf]* [[Dana S. Nau]] ('''1982'''). ''An Investigation of the Causes of Pathology in Games.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 19, 257–278, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park], Recommended by [[Judea Pearl]], [http://www.cs.umd.edu/%7Enau/papers/nau82investigation.pdf pdf]

* [[Dana S. Nau]] ('''1983'''). ''Decision quality as a function of search depth on game trees.'' Journal of the ACM 30(4):687–708, [http://www.cs.umd.edu/%7Enau/papers/nau83decision.pdf pdf]* [[Dana S. Nau]] ('''1983'''). ''Pathology on game trees revisited, and an alternative to minimaxing.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 21, No. 1-2, Reprinted in [[Judea Pearl]] (ed.), Search and Heuristics, North-Holland Publishing Company, Amsterdam, [http://www.cs.umd.edu/%7Enau/papers/nau83pathology.pdf pdf]

* [[Brandon Wilson]], [[Austin Parker]], [[Dana S. Nau]] ('''2009'''). ''Error Minimizing Minimax: Avoiding Search Pathology in Game Trees''. [http://www.cs.umd.edu/~nau/papers/wilson2009error.pdf pdf]

* [[Dana Nau|Dana S. Nau]], [[Mitja Luštrek]], [[Austin Parker]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2010'''). ''[http://www.sciencedirect.com/science/article/pii/S0004370210001402 When is it better not to look ahead?]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 174, No. 16–17, [http://dis.ijs.si/mitjal/documents/Nau-When_is_it_better_not_to_look_ahead-AIJ-10.pdf preprint as pdf]