Changes

[[FILE:hannah-hoche_da-dandy-1919.jpg|border|right|thumb|link=http://littlemissartypants.tumblr.com/post/12081930289/hannah-h%C3%B6ch-da-dandy-1919-the-photomontage-da|[[Arts#Hoech:Category:Hannah Höch|Hannah Höch]] - Da Dandy <ref>[[Arts#Hoech:Category:Hannah Höch|Hannah Höch]] - Da Dandy, 1919, [http://littlemissartypants.tumblr.com/post/12081930289/hannah-h%C3%B6ch-da-dandy-1919-the-photomontage-da Hannah Höch | Da-Dandy (1919)]</ref> ]]

<span id="Recursion"></span>While [[YBWC ]] is difficult to implement recursively, ABDADA is not. In YBWC, when a processor receives an evaluation answer from one of its slaves, it must be able to produce a jump in the search depth if this evaluation produces a pruning of the current master node. So the values of [[Alpha|alpha]] and [[Beta|beta]] must at least be kept in [[Array|arrays]] indexed by [[Ply|ply]] distance from root, and special arrangements must be made to counteract the disruption that might occur from confusing depths. Therefor YBWC needs a hugely modified [[Iterative Search|iterative search]] algorithm. In his paper <ref>[[Jean-Christophe Weill]] ('''1996'''). ''[http://portal.acm.org/citation.cfm?id=228345 The ABDADA Distributed Minimax Search Agorithm]''. 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 postscript]</ref> , Weill states that using ABDADA within a recursive [[NegaScout]] framework was 30% faster than a none-recursive search, which was observed independently by [[Mark Brockington]] in 1994 <ref>[[Mark Brockington]] ('''1994'''). ''An Implementation of the Young Brothers Wait Concept''. Internal report, [[University of Alberta]]</ref> . It can be explained by the fact that within high-level languages and their compilers for certain target platforms, the use of procedure [[Stack|stacks]] is much more optimized than the use of indexed arrays, also observed by [https://en.wikipedia.org/wiki/Niklaus_Wirth Niklaus Wirth] concerning the [https://en.wikipedia.org/wiki/Quicksort Quicksort] algorithm <ref>[https://en.wikipedia.org/wiki/Niklaus_Wirth Niklaus Wirth] ('''1976'''). ''[https://en.wikipedia.org/wiki/Algorithms_%2B_Data_Structures_%3D_Programs Algorithms + Data Structures = Programs]''. pp 100</ref> .

The [[Free Software Foundation#GPL|GPL]] [[:Category:Open Source Engines|open source chess engine]] [[Smash]] by [[Maurizio Sambati]] demonstrates an ABDADA implementation in [[Cpp|C++]] <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=165470&t=18611 Re: interested in making single procesor program multi] by [[Alessandro Scotti]], [[CCC]], December 29, 2007</ref> <ref>[http://www.cli.di.unipi.it/~sambati/prog/smash.tar.bz2 smash.tar.bz2 search.cpp]</ref> .

* [[Marc-François Baudot]], [[Jean-Christophe Weill]], [[Jean-Luc Seret]], [[Michel Gondran]] ('''1995'''). ''[https://www.researchgate.net/publication/228386252_Frenchess_A_Cray_T3D_at_the_8th_World_Computer_Chess_Championship Frenchess: A Cray T3D at the 8th World Computer Chess Championship]''. First European Cray-T3D Workshop, [http://wwwciteseerx.rechercheist.enacpsu.fredu/%7Eweillviewdoc/publications/papiersummary?doi=10.1.1.ps78.gz zipped ps967 Citeseex]

* [https://www.stmintz.com/ccc/index.php?id=163888 Parallel algorithms in chess programming] by [[Dieter Bürssner|Dieter BuerssnerBürßner]], [[CCC]], April 16, 2001

* [[Videos#JeanLucPonty:Category:Jean-Luc Ponty|Jean luc -Luc Ponty]] - Final Truth (Part 2), [https://en.wikipedia.org/wiki/Montreal_International_Jazz_Festival Montreal Jazz Festival], 1982, [https://en.wikipedia.org/wiki/YouTube YouTube] Video