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 ...==
* [[Liwu Li]], [[Tony Marsland]] ('''1990'''). ''On Minimax Game Tree Search Pathology and Node-value Dependence''. TR90-24, [[University of Alberta]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR90-24.pdf pdf]
* [[Claude G. Diderich]] ('''1993'''). ''[http://portal.acm.org/citation.cfm?id=165007 A Bibliography on Minimax Trees]''. [[ACM#SIG|ACM SIGACT News]], Vol. 24, No. 4
* [[David E. Moriarty]], [[Risto Miikkulainen]] ('''1994'''). ''[http://nn.cs.utexas.edu/?moriarty:aaai94 Evolving Neural Networks to focus Minimax Search]''. [[Conferences#AAAI-94|AAAI-94]], [http://www.cs.utexas.edu/~ai-lab/pubs/moriarty.focus.pdf pdf] » [[Othello]]
* [[Claude G. Diderich]], [[Marc Gengler]] ('''1995'''). ''[http://link.springer.com/chapter/10.1007/978-1-4613-3557-3_2 A Survey on Minimax Trees and Associated Algorithms]''. ''[http://link.springer.com/book/10.1007/978-1-4613-3557-3 Minimax and Its Applications]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Kluwer Academic Publishers]
* [[Richard Korf]], [[Max Chickering]] ('''1996'''). ''[https://www.microsoft.com/en-us/research/publication/best-first-minimax-search/ Best-first minimax search]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 84, Nos 1-2 » [[Best-First]]
==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]]
==2020 ...==
* [[Quentin Cohen-Solal]], [[Tristan Cazenave]] ('''2020'''). ''Minimax Strikes Back''. [https://arxiv.org/abs/2012.10700 arXiv:2012.10700] » [[Reinforcement Learning]]
=Forum Posts=
* [http://www.talkchess.com/forum/viewtopic.php?t=13433 beyond minimax] by [[Harm Geert Muller]], [[CCC]], April 27, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=42806 The evaluation value and value returned by minimax search] by [[Chao Ma Chao]], [[CCC]], March 09, 2012 » [[Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=54295 Why minimax is fundamentally flawed] by [[Harm Geert Muller]], [[CCC]], November 09, 2014 » [[KRK]]
