25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Search]] * Principal Variation Search'''
[[FILE:Cage-variations-iii-14-small.jpg|border|right|thumb|link=https://en.wikipedia.org/wiki/File:Cage-variations-iii-14-small.jpg|[[Arts#:Category:John Cage|John Cage]] - Variations III, No. 14 <ref>[https://en.wikipedia.org/wiki/File:Cage-variations-iii-14-small.jpg Variations III, No. 14], a 1992 print by [[Arts#:Category:John Cage|John Cage]] from a series of 57, [https://en.wikipedia.org/wiki/John_Cage John Cage from Wikipedia] [https://en.wikipedia.org/wiki/Fair_use Fair use]</ref> ]]
'''Principal Variation Search (PVS)''',<br/>
=PVS and Aspiration=
When implementing PVS together with the [[Aspiration Windows|aspiration window]], one must be aware that in this case also a normal window search might fail, leaving the program with no move and no PV. (Actually this is the reason why I wrote "When we already have a PV move" and not "searching later moves").
* [[PVS and aspirationAspiration]]
A state of the art [[Fail-Soft|fail-soft]] PVS implementation, called without aspiration, was posted by [[Vincent Diepeveen]] inside the mentioned [[CCC]] thread <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=255191&t=26974 Re: PVS] by [[Vincent Diepeveen]], [[CCC]], March 14, 2009</ref> :
* [[NegaScout]]
* [[Null Window]]
* [[Principal Variation]]* [[PVS and aspirationAspiration]]
* [[Scout]]
* [[Alexander Reinefeld]], [[Tony Marsland]] ('''1987'''). ''A Quantitative Analysis of Minimal Window Search.'' [http://www.informatik.uni-trier.de/%7Eley/db/conf/ijcai/ijcai87.html IJCAI-87], [http://webdocs.cs.ualberta.ca/~tony/OldPapers/ijcai87.pdf pdf]
==2000 ...==
* [[Mark Winands]], [[Jaap van den Herik]], [[Jos Uiterwijk]] and , [[Erik van der Werf]] ('''2003'''). ''[https://research.tilburguniversity.edu/en/publications/enhanced-forward-pruning Enhanced forward pruning]''. JCIS 2003* [[Mark Winands]], [[Jaap van den Herik]], [[Jos Uiterwijk]], [[Erik van der Werf]] ('''2005''').'' Accepted for publicationEnhanced Forward Pruning''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 175, No. 4, [http://www.personeelerikvanderwerf.unimaastengen.nl/m-winands/documentspubdown/Enhanced%20forward%20pruning.pdf pdfpreprint] (with PVS modifications)
=Forum Posts=
==2005 ...==
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6558 Slight enhancement to PVS] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Programming Forum]], June 10, 2007
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6665 Search questions] by [[Sven Schüle]], [[Computer Chess Forums|Winboard Forum]], July 17, 2007 » [[Fail -Soft]]* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=16724&p=147515 Tuning PVS] by [[Aleks Peshkov]], [[CCC]], September 27, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=24883 when to try zero window search], [[CCC]], November 14, 2008
* [http://www.talkchess.com/forum/viewtopic.php?t=26974 PVS] by [[Edmund Moshammer]], [[CCC]], March 12, 2009
* [http://www.open-chess.org/viewtopic.php?f=5&t=2208 principle variation search] by nak3c, [[Computer Chess Forums|OpenChess Forum]], January 09, 2013
* [http://www.open-chess.org/viewtopic.php?f=5&t=2218 Implementing pvs] by [[Christian Daley|CDaley11]], [[Computer Chess Forums|OpenChess Forum]], January 13, 2013
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=48137 Question about PVS and nodes type] by [[Patrice Duhamel]], [[CCC]], May 28, 2013 » [[Node Types]]
* [http://www.talkchess.com/forum/viewtopic.php?t=53626 Improvement from PVS] by [[Matthew Lai]], [[CCC]], September 09, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=53972 Your experience with PVS + Aspiration window] by [[Fabio Gobbato]], [[CCC]], October 07, 2014 » [[Aspiration Windows]], [[PVS and aspirationAspiration]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=55709 Question on standard implementation of PVS+NWS] by Rob Williamson, [[CCC]], March 19, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=60719 PVS/NegaScout: Actual benefits] by [[Vincent Tang]], [[CCC]], July 06, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=62913 bound type in PVS ?] by [[Mahmoud Uthman]], [[CCC]], January 23, 2017 » [[Bound]], [[Exact Score]]
* [http://www.open-chess.org/viewtopic.php?f=5&t=3084 LMR and PVS] by thevinenator, [[Computer Chess Forums|OpenChess Forum]], February 10, 2017 » [[Late Move Reductions]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65490 PVS & Embla] by [[Folkert van Heusden]], [[CCC]], October 19, 2017 » [[Embla]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=69252 out of time in PVS] by Louis Mackenzie-Smith, [[CCC]], December 13, 2018
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=75549 Principal Variation Search vs. Transposition Table] by [[Marcel Vanthoor]], [[CCC]], October 26, 2020 » [[Principal Variation]]
=External Links=
* [http://web.archive.org/web/20070809015901/www.seanet.com/~brucemo/topics/pvs.htm Principal Variation Search] from [[Bruce Moreland|Bruce Moreland's]] [http://web.archive.org/web/20070811182741/www.seanet.com/%7Ebrucemo/topics/topics.htm Programming Topics]
* [https://www.ics.uci.edu/~eppstein/180a/990202b.html Lecture notes for February 2, 1999 Variants of Alpha-Beta Search] by [[David Eppstein]]
* [https://en.wikipedia.org/wiki/Negascout NegaScout or Principal Variation Search from Wikipedia]
'''[[Search|Up one level]]'''
[[Category:John Cage]]
[[Category:Videos]]
