25,161
edits
Changes
no edit summary
* [[Ivan Bratko]], [[Matjaž Gams]] ('''1982'''). ''Error Analysis of the Minimax Principle''. [[Advances in Computer Chess 3]]
* [[Don Beal]] ('''1982'''). ''Benefits of minimax search''. [[Advances in Computer Chess 3]]
* [[Dana S. Nau]] ('''1983'''). ''Decision quality as a function of search depth on game trees.'' [[ACM#Journal|Journal of the ACM ]], Vol. 30(, No. 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]
* [[Judea Pearl]] ('''1983'''). ''On the Nature of Pathology in Game Searching''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 20* [[Chun-Hung Tzeng]], 427[[Paul W. Purdom]] ('''1983'''). ''[https://www.aaai.org/Library/AAAI/1983/aaai83-453080.php A Theory of Game Trees]''.[[Conferences#AAAI-83|AAAI-83]]
==1985 ...==
* [[Bruce Abramson]] ('''1985'''). ''A Cure for Pathological Behavior in Games that Use Minimax.'' [[Laveen Kanal#Uncertainty AI 1|Uncertainty in Artificial Intelligence 1]], [https://arxiv.org/abs/1304.3444 arXiv:1304.3444]
