Changes

The development of [[Recursion|recursive]] variants was driven by the need for a better understanding of '''SSS'''*'s node expansion process and by the demand for more efficient implementations. Two recursive variants were proposed 1990: '''RecSSS'''* <ref>[[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1990'''). ''Unified Recursive Schemes for Search in Game Trees.'' Technical Report WPS-144, [https://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta]</ref> by [[Subir Bhattacharya]] and [[Amitava Bagchi]] and '''SSS-2''' <ref>[[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm.'' . International Symposium SIGAL '90 (eds. T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki), pp. 211-220. Tokyo, Japan. Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, New York, NY. ISSN 0302-9743.</ref> by [[Wim Pijls]] and [[Arie de Bruin]]. In 1993 [[Alexander Reinefeld]] improved '''RecSSS'''*, making it both faster and more space efficient, using an OPEN-[[Array|array]] rather than dynamic list structures <ref>[[Alexander Reinefeld]] ('''1994'''). ''A Minimax Algorithm Faster than Alpha-Beta''. [[Advances in Computer Chess 7]]</ref> .

[[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]] and [[Arie de Bruin]] proved with their Memory Test framework, that both '''SSS'''* and '''Dual'''* can be reformulated as a sequence of [[Alpha-Beta|alpha-beta]] [[Null Window|null window]] calls with a [[Transposition Table]] <ref>[[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''19951994, 2014'''). ''SSS* = Alpha-Beta + TT'' Technical Report EUR. TR-CS-9594-0217, [[University of Alberta]], [httphttps://publishing.eurarxiv.nlorg/irabs/repub/asset/1441/eur-few-cs-95-021404.1517 arXiv:1404.pdf pdf1517]</ref> :

At the [[Advances in Computer Chess 8|8th Advances in Computer Chess]] conference 1996, '''SSS'''* was finally declared "dead" by [[Wim Pijls]] and [[Arie de Bruin]] <ref>[[Arie de Bruin]], [[Wim Pijls]] ('''1997'''). ''SSS†.'' [[Advances in Computer Chess 8]]</ref> <ref>[[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]]('''1996'''). ''Best-First Fixed-Depth Minimax Algorithms.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 87, Nos. 1-2, [http://www.ldc.usb.ve/%7Ebonet/courses/ci5437/papers/mtd.pdf pdf]</ref> .

* [[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm.'' International Symposium SIGAL '90 (eds. T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki), pp. 211-220. Tokyo, Japan. Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, New York, NY. ISSN 0302-9743.

* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''[http://arxiv.org/abs/1404.1517?context=cs.AI SSS* = aAlpha-b Beta + TT]''. TR-CS-94-17, [[University of Alberta]], [https://arxiv.org/abs/1404.1517 arXiv:1404.1517]

* [[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=04E25D5F074D8B5BABB68D2AC5BA5D39?cid10.1.1.77.9111&rep=rep1&type=3161130 pdf pdf] from [httphttps://citeseerxen.ist.psuwikipedia.eduorg/viewdocwiki/summary?doi=10.1.1.50.8641 CiteSeerX CiteSeerX], covers » [[MTD(f)]]

==2000 ...==* [[Aske Plaat]], [[Arie de Bruin]], [[Jonathan Schaeffer]], [[Wim Pijls]] ('''19992003'''). ''A Minimax Algorithm better than SSS*[https://repub.eur.nl/pub/459 Trends in game tree search]'' . [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial IntelligenceErasmus_University_Rotterdam Erasmus University, Rotterdam], Vol. 87