25,161
edits
Changes
no edit summary
* [[Jean-Christophe Weill]] elaborated on [[NegaC*]] <ref>[[Jean-Christophe Weill]] ('''1991'''). ''Experiments With the NegaC* Search - An Alternative for Othello Endgame Search.'' Heuristic Programming in Artificial Intelligence 2: the second computer olympiad (eds. [[David Levy]] and [[Don Beal]]), pp. 174-188. Ellis Horwood, Chichester. ISBN 0-13-382615-5, [http://www.recherche.enac.fr/%7Eweill/publications/negac.ps.gz zipped ps] and [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.39.3189&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3189 CiteSeerX]</ref> and for [[Parallel Search|parallel search]] on [[ABDADA]] <ref>[[Jean-Christophe Weill]] ('''1996'''). ''[http://portal.acm.org/citation.cfm?id=228345 The ABDADA Distributed Minimax Search Algorithm]''. Proceedings of the 1996 ACM Computer Science Conference, pp. 131-138. ACM, New York, N.Y, reprinted [[ICGA Journal#19_1|ICCA Journal, Vol. 19, No. 1]], [http://www.recherche.enac.fr/%7Eweill/publications/acm.ps.gz zipped ps]</ref>.
* [[Michael Buro]] successfully implemented his [[ProbCut]] and [[ProbCut#MPC|Multi-ProbCut]] (MPC) as [[Selectivity|selective]] extension <ref>[[Michael Buro]] ('''1995'''). ''ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm.'' [[ICGA Journal#18_2|ICCA Journal, Vol. 18, No. 2]], pp. 71-76, [http://www.cs.ualberta.ca/%7Emburo/ps/probcut.pdf pdf]</ref> inside his successful Othello program ''Logistello'' <ref>[http://www.cs.ualberta.ca/%7Emburo/log.html Logistello's Homepage]</ref>, already described in his Ph.D. thesis <ref>[[Michael Buro]] ('''1994'''). ''Techniken für die Bewertung von Spielsituationen anhand von Beispielen.'' Ph.D. Thesis. [[Paderborn University of Paderborn]], Paderborn, Germany. [http://www.cs.ualberta.ca/%7Emburo/ps/mics_dis.pdf pdf] (German)</ref>.
* The ''Asycnhronous Parallel Hierarchical Iterative Deepening'' algorithm, [[APHID]] by [[Mark Brockington]] was applied to Othello as well <ref>[[Mark Brockington]], [[Jonathan Schaeffer]] ('''1996'''). ''The APHID Parallel αβ Search Algorithm''. Technical Report 96-07, Department of Computing Science, [[University of Alberta]], Edmonton, Alberta, Canada. as [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.23.8215&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.8215 CiteSeerX]</ref> <ref>[[Mark Brockington]], [[Jonathan Schaeffer]] ('''1997'''). ''APHID Game-Tree Search''. [[Advances in Computer Chess 8]]</ref> <ref>[http://webdocs.cs.ualberta.ca/~games/aphid/index.html APHID Parallel Game-Tree Search Library]</ref> <ref>[[Mark Brockington]] ('''1998'''). ''Asynchronous Parallel Game-Tree Search''. Ph.D. Thesis, [[University of Alberta]], [http://games.cs.ualberta.ca/articles/mgb_thesis.ps.gz zipped postscript]</ref>.
* In 2011, [[Jean Méhat]] and [[Tristan Cazenave]] implemented [[Monte-Carlo Tree Search]] in parallel [[General Game Playing]], also covering Othello with promising results <ref>[[Jean Méhat]], [[Tristan Cazenave]] ('''2011'''). ''A Parallel General Game Player''. [http://www.kuenstliche-intelligenz.de/ KI Journal], Vol. 25, No. 1, [http://www.lamsade.dauphine.fr/~cazenave/papers/rootparallelggp.pdf pdf]</ref>.
