25,161
edits
Changes
no edit summary
* [[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]]
