25,161
edits
Changes
no edit summary
==1980 ...==
* [[Ivan Bratko]], [[Matjaž Gams]] ('''1982'''). ''Error Analysis of the Minimax Principle''. [[Advances in Computer Chess 3]]
* [[Chun-Hung Tzeng]], [[Paul W. Purdom]] ('''1983'''). ''[https://www.aaai.org/Library/AAAI/1983/aaai83-080.php A Theory of Game Trees]''. [[Conferences#AAAI-83|AAAI-83]]
* [[Dana S. Nau]], [[Paul W. Purdom]], [[Chun-Hung Tzeng]] ('''1986'''). ''Experiments on Alternatives to Minimax''. [https://dblp.uni-trier.de/db/journals/ijpp/ijpp15.html#NauPT86 International Journal of Parallel Programming, Vol. 15], No. 2
* [[Dana S. Nau]], [[Paul W. Purdom]], [[Chun-Hung Tzeng]] ('''1986, 2013'''). ''An Evaluation of Two Alternatives to Minimax''. Machine Intelligence and Pattern Recognition, Vol. 4, [https://arxiv.org/abs/1304.3445 arXiv:1304.3445]
* [[Ronald L. Rivest]] ('''1987'''). ''Game Tree Searching by Min/Max Approximation''. Artificial Intelligence Vol. 34, 1, [http://people.csail.mit.edu/rivest/Rivest-GameTreeSearchingByMinMaxApproximation.pdf pdf 1995]
==1990 ...==
==2010 ...==
* [[Jeff Rollason]] ('''2014'''). ''[http://www.aifactory.co.uk/newsletter/2014_01_interest_minimax.htm Interest Search - Another way to do Minimax]''. [[AI Factory]], Summer 2014
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Anton Scheucher]] ('''2017'''). ''[https://ieeexplore.ieee.org/document/7358032 Product Propagation: A Back-up Rule Better than Minimaxing?]'' [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 9, No. 2, [[:File:KaindlProductPropagation.pdf|pdf]]
=Forum Posts=
