Changes

Opponent Model search was further investigated by various game researchers, such as [[Mathematician#DCarmel|David Carmel]], [[Shaul Markovitch]], [[Xinbo Gao]], [[Hiroyuki Iida]], [[Jos Uiterwijk]], [[Jaap van den Herik]], [[Bob Herschberg]], [[Jeroen Donkers]], [[Pieter Spronck]] and [[Sander Bakkes]].

Carmel and Markovitch introduced '''M'''* <ref>[[Mathematician#DCarmel|David Carmel]], [[Shaul Markovitch]] ('''1994'''). ''[https://www.semanticscholar.org/paper/The-M*-Algorithm%3A-Incorporating-Opponent-Models-Carmel-Markovitch/bd788272c81951dc44fa7944e0f72451ced14129 The M* Algorithm: Incorporating Opponent Models into Adversary Search]''. CIS Report #9402, [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-CIS9402.pdf pdf]</ref>, a generalization of [[Minimax|minimax]] that uses an arbitrary opponent model to simulate the opponent’s search, and further proved a sufficient condition for pruning and present the '''αβ'''* algorithm which returns the M* value of a tree while searching only necessary branches <ref>[[Mathematician#DCarmel|David Carmel]], [[Shaul Markovitch]] ('''1996'''). ''Incorporating Opponent Models into Adversary Search''. [[Conferences#AAAI-96|AAAI 1996]], [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-aaai1996.pdf pdf]</ref> . Gao et al. researched on a generalization of opponent model search, called '''(D, d)-OM''' search, where '''D''' stands for the [[Depth|depth]] of [[Search|search]] by the player and '''d''' for the opponent’s depth of search <ref>[[Xinbo Gao]], [[Hiroyuki Iida]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''1998'''). ''[http://link.springer.com/chapter/10.1007/3-540-48957-6_5 A Speculative Strategy]''. [[CG 1998]]</ref> . The '''Probabilistic''' Opponent-Model Search ('''PrOM''') for several game domains was developed by Donkers, Uiterwijk and Van den Herik, published in 2000 <ref>[[Jeroen Donkers]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2000'''). ''Investigating Probabilistic Opponent-Model Search''. JCIS 2000, [http://www.fdg.unimaas.nl/educ/donkers/pubs/..%5Cpdf%5Cbnaic00.pdf pdf] (extended abstract)</ref> . It uses an extended model that includes uncertainty of the opponent.

* [[Mathematician#DCarmel|David Carmel]], [[Shaul Markovitch]] ('''1993'''). ''[https://aaai.org/Library/Symposia/Fall/1993/fs93-02-019.php Learning Models of Opponent's Strategy in Game Playing]''. [[Conferences#AAAI-93|AAAI 1993]], FS-93-02, [https://www.aaai.org/Papers/Symposia/Fall/1993/FS-93-02/FS93-02-019.pdf pdf]

* [[Mathematician#DCarmel|David Carmel]], [[Shaul Markovitch]] ('''1994'''). ''[https://www.semanticscholar.org/paper/The-M*-Algorithm%3A-Incorporating-Opponent-Models-Carmel-Markovitch/bd788272c81951dc44fa7944e0f72451ced14129 The M* Algorithm: Incorporating Opponent Models into Adversary Search]''. CIS Report #9402, [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-CIS9402.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=54865&start=27 Re: Different eval for white/black] by [[Ronald de Man]], [[CCC]], January 08, 2015</ref>

* [[Mathematician#DCarmel|David Carmel]], [[Shaul Markovitch]] ('''1996'''). ''Incorporating Opponent Models into Adversary Search''. [[Conferences#AAAI-96|AAAI 1996]], [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-aaai1996.pdf pdf]