25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Search]] * MTD(f)'''
[[FILE:EschersAscending_and_Descending.jpg|border|right|thumb|link=http://www.mcescher.com/Gallery/recogn-bmp/LW435.jpg| [[Arts#:Category:M. C. Escher|M. C. Escher]], Ascending and Descending, 1960 <ref>[[Arts#:Category:M. C. Escher|M. C. Escher]], Ascending and Descending, 1960, [http://www.mcescher.com/Gallery/gallery-recogn.htm Picture gallery "Recognition and Success 1955 - 1972" ] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref> <ref>[https://en.wikipedia.org/wiki/Penrose_stairs Penrose stairs from Wikipedia]</ref> ]]
'''MTD(f)''',<br/>
</pre>
=See Also= * [[:Category:MTD(f)]]
* [[Aspiration Windows]]
* [[Iterative Deepening]]
=Publications=
==1994 ...==
* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''SSS* = Alpha-Beta + TT''. TR-CS-94-17, [[httpUniversity of Alberta]], [https://arxiv.org/abs/1404.1515?context=cs1517 arXiv:1404.1517]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014''').AI ''A New Paradigm for Minimax Search]''. TR -CS 94-18, [[University of Alberta]], [https://arxiv.org/abs/1404.1515 arXiv:1404.1515]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1995, 2015'''). ''Best-First Fixed Depth Game Tree Search in Practice.'' [[Conferences#IJCAI1995|IJCAI-95]], [https://arxiv.org/abs/1505.01603 arXiv:1505.01603]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''Best-First Fixed-Depth Minimax Algorithms.''. [httphttps://wwwen.ldcwikipedia.usborg/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol.ve87* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996, 2017'''). ''A Minimax Algorithm Better Than Alpha-beta?: No and Yes''. [https:/%7Ebonet/coursesarxiv.org/ci5437abs/papers/mtd1702.03401 arXiv:1702.pdf pdf03401]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''An Algorithm Faster than NegaScout and SSS* in Practice''. [http://citeseerx.ist.psu.edu/showciting;jsessionidviewdoc/download?doi=10.1.1.77.9111&rep=04E25D5F074D8B5BABB68D2AC5BA5D39?cidrep1&type=3161130 pdf pdf] from [httphttps://citeseerxen.istwikipedia.psu.eduorg/viewdocwiki/summary?doi=10.1.1.50.8641 CiteSeerX CiteSeerX]* [[Aske Plaat]] ('''1997, 2014'''). ''[http://arxiv.org/abs/1404.1511?context=cs.AI MTD(f), A Minimax Algorithm Faster Than NegaScout]''. Internal Report, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], [https://arxiv.org/abs/1404.1511?context=cs.AI arXiv:1404.1511]
==2000 ...==
* [[Arie de Bruin]], [[Wim Pijls]] ('''2003'''). ''[https://repub.eur.nl/pub/459 Trends in game tree search]''. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam]
* [[Jacek Mańdziuk]], [[Daniel Osman]] ('''2004'''). ''Alpha-Beta Search Enhancements with a Real-Value Game-State Evaluation Function''. [[ICGA Journal#27_1|ICGA Journal, Vol. 27, No. 1]], [http://www.mini.pw.edu.pl/~mandziuk/PRACE/ICGA.pdf pdf]
* [[Kazutomo Shibahara]], [[Nobuo Inui]], [[Yoshiyuki Kotani]] ('''2005'''). ''Adaptive Strategies of MTD-f for Actual Games''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2005.html#ShibaharaIK05 CIG 2005], [http://cswww.essex.ac.uk/cig/2005/papers/p1018.pdf pdf]
==2010 ...==
* [[Eric Stock]], [[David J. King]] ('''2010'''). ''[https://rke.abertay.ac.uk/en/publications/a-new-enhancement-to-mtdf A new enhancement to MTD(f)]''. Games and Arts, [https://en.wikipedia.org/wiki/Abertay_University Abertay University], [https://www.researchgate.net/publication/304307495_A_New_Enhancement_to_MTDf ResearchGate] <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=7&t=31130 MTD(f) experiments with Crafty] by [[Eric Stock]], [[CCC]], December 18, 2009</ref>
* [[Jr-Chang Chen]], [[I-Chen Wu]], [[Wen-Jie Tseng]], [[Bo-Han Lin]], [[Chia-Hui Chang]] ('''2015'''). ''[https://ir.nctu.edu.tw/handle/11536/124541 Job-Level Alpha-Beta Search]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 7, No. 1
* [[Jan-Jaap van Horssen]] ('''2018'''). ''Handling Search Inconsistencies in MTD(f)''. [https://jhorssen.home.xs4all.nl/Maximus/research/Handling%20Search%20Inconsistencies%20in%20MTDf.pdf pdf]
* [[Jan-Jaap van Horssen]] ('''2019'''). ''Move selection in MTD(f) ''. [[ICGA Journal#41_1|ICGA Journal, Vol. 41, No. 1]]
=Forum Posts=
'''1999'''
* [https://www.stmintz.com/ccc/index.php?id=43395 Re: CilkChess] by [[Don Dailey]], [[CCC]], February 14, 1999 » [[CilkChess]]
* [https://www.stmintz.com/ccc/index.php?id=51608 mtdf] by [[Daniel Homan]], [[CCC]], May 13, 1999 * [https://www.stmintz.com/ccc/index.php?id=60833 Building the Principal Variation in MTD(f) searches] by [[Andrew Williams]], [[CCC]], July 18, 1999 » [[Principal variationVariation]]
* [https://www.stmintz.com/ccc/index.php?id=61058 MTD is a big win] by [[Don Dailey]], [[CCC]], July 19, 1999
* [https://www.stmintz.com/ccc/index.php?id=70890 MTD(f)] by Nicolas Carrasco, [[CCC]], September 28, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=95696 Getting a PV using MTD(f)] by [[Tijs van Dam]], [[CCC]], February 08, 2000 » [[Principal variationVariation]]* [https://groups.google.com/d/msg/rec.games.chess.computer/Prqz2SzYuoc/4SkqqUYhrIsJ MTD(f) and PV] by [[David Rasmussen]], [[Computer Chess Forums|rgcc]], March 09, 2000 » [[Principal variationVariation]]
'''2001'''
* [https://groups.google.com/d/msg/rec.games.chess.computer/AEFIYBEvCFA/66YpNnmDYiUJ MTD(f) and the PV] by Adrian Jackson, [[Computer Chess Forums|rgcc]], March 16, 2001 » [[Principal variationVariation]]
* [https://www.stmintz.com/ccc/index.php?id=173514 Beating MTD(n,f)] by [[Gian-Carlo Pascutto]], [[CCC]], June 05, 2001
* [https://www.stmintz.com/ccc/index.php?id=179391 MTD(f) and killer heuristics] by Marcus Heidkamp, [[CCC]], July 12, 2001 » [[Killer Heuristic]]
* [https://www.stmintz.com/ccc/index.php?id=251302 Couple of chess programming questions] by Eli Liang, [[CCC]], September 10, 2002 » [[ProbCut]], [[Evaluation]], [[Bitboards]], [[0x88]], [[Depth#FractionalPlies|Fractional Plies]], [[Transposition Table]]
: [https://www.stmintz.com/ccc/index.php?id=251522 Re: Couple of chess programming questions - MDT and parallel] by [[Scott Farrell]], [[CCC]], September 10, 2002 » [[Parallel Search]]
* [https://www.stmintz.com/ccc/index.php?id=251543 calculating the PV using MTD] by [[Fabien Letouzey]], [[CCC]], September 11, 2002 » [[Principal variationVariation]]
* [https://www.stmintz.com/ccc/index.php?id=251687 MTD: an observation and a question] by [[Martin Fierz]], [[CCC]], September 11, 2002
'''2003'''
* [https://www.stmintz.com/ccc/index.php?id=480865 MTD(f) and Wikipedia] by [[Joachim Rang]], [[CCC]], January 19, 2006
* [http://www.talkchess.com/forum/viewtopic.php?t=21360 MTD(f) experiences] by [[Don Dailey]], [[CCC]], May 25, 2008
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=31130 MTD(f) experiments with Crafty] by [[Eric Stock]], [[CCC]], December 18, 2009 » [[Crafty]] <ref>[[Eric Stock]], [[David J. King]] ('''2010'''). ''[https://rke.abertay.ac.uk/en/publications/a-new-enhancement-to-mtdf A new enhancement to MTD(f)]''. Games and Arts, [https://en.wikipedia.org/wiki/Abertay_University Abertay University]</ref>
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=53388 An Idea Of speeding up MTD-f] by [[Pio Korinth]], [[CCC]], August 22, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=60583 MTD-f: Extracting PV ?] by [[Henk van den Belt]], [[CCC]], June 24, 2016
* [https://groups.google.com/forum/#!topic/fishcooking/ivM7n3DFQX8 mtd(f)] by stefano.c, [[Computer Chess Forums|FishCooking]], August 7, 2016 » [[Stockfish]]
* [http://laatste.info/bb3/viewtopic.php?f=53&t=7903 Handling search inconsistencies in MTD(f)] by [[Jan-Jaap van Horssen]], [http://laatste.info/bb3/viewforum.php?f=53 World Draughts Forum], February 26, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=67783 What am I missing with respect to MTDf] by [[Jonathan Rosenthal]], [[CCC]], June 21, 2018
==2020 ...==
* [http://talkchess.com/forum3/viewtopic.php?f=7&t=74971 MTDF - what am I doing wrong?] by Alex Baker, [[CCC]], September 02, 2020
=External Links=
* [http://people.csail.mit.edu/plaat/mtdf.html MTD(f) - A Minimax Algorithm faster than NegaScout] by [[Aske Plaat]]
* [https://jhorssen.home.xs4all.nl/Maximus/research/mtdf/index.htm MTD(f) Experiments] by [[Jan-Jaap van Horssen]]
* [https://en.wikipedia.org/wiki/MTD-f MTD(f) from Wikipedia]
* [https://www.ics.uci.edu/~eppstein/180a/990202b.html Lecture notes for February 2, 1999 Variants of Alpha-Beta Search] by [[David Eppstein]]* [Videos#JanGarbarek[:Category:Jan Garbarek|Jan Garbarek]], [[Videos#KeithJarrett:Category:Keith Jarrett|Keith Jarrett]], [https://en.wikipedia.org/wiki/Palle_Danielsson Palle Danielsson], [[Videos#JonChristensen:Category:Jon Christensen|Jon Christensen]] - [https://en.wikipedia.org/wiki/Belonging_%28album%29 Spiral Dance], 1974, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=oZuPd9dVApo|alignment=left|valignment=top}}
=References=
<references />
'''[[Search|Up one level]]'''
[[Category:M. C. Escher]]
[[Category:Jon Christensen]]
[[Category:Jan Garbarek]]
[[Category:Keith Jarrett]]
