25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Engines]] * CHAOS'''
[[FILE:Boldriaan chaos.jpg|border|right|thumb|link=http://www.schaakkunst.nl/Schaakkunst_Boldriaan.htm|[[Arts#:Category:Boldriaan|Boldriaan]] - CHAOS (2006) <ref>[http://www.schaakkunst.nl/Schaakkunst_Boldriaan.htm Schaakkunst van Boldriaan]</ref> ]]
'''CHAOS''' was one of the leading programs since it first appeared at [[ACM 1973]] until the mid 80s. CHAOS, which stands facetiously for ''Chess Heuristics And Other Stuff'', has participated in twelve [[ACM North American Computer Chess Championship|ACM tournaments]] <ref>[http://old.csvn.nl/ncc_hist.html North American Computer-Chess Championships], complete History of Tournament Results and Games, prepared by [[Theo van der Storm]], Nov. 23rd, 2002, secretary of the [[CSVN]]</ref> and four [[World Computer Chess Championship|world championships]] <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=42 Chaos' ICGA Tournaments]</ref> , runner up in [[WCCC 1974|1974]] behind [[Kaissa]], defeating favorite [[Chess (Program)|Chess 4.0]]. In 1980 at the [[WCCC 1980|3rd WCCC]], CHAOS was close to becoming champion but lost the playoff against [[Belle|Belle.]] Its last tournament was the [[ACM 1985|16th AMC 1985]] when it lost two games in a very strong field.
=Knowledge vs Search=
CHAOS was written in [[Fortran]] and required in excess of 3,000,000 words of memory to execute, using most of it for storing the [[Search Tree|tree]]. It examines only about 50 [[Nodes per secondSecond|nodes/sec]] (1985 70 nodes/sec <ref>[http://www.amazon.co.uk/David-E-Welsh/e/B000AP7TNG/ref=ntt_athr_dp_pel_1 David .E. Welsh] ('''1986'''). ''[[ACM 1985|ACM's Sixteenth North American Computer Chess Championship]]''. [[ICGA Journal|ICCA Journal]], Vol. 8, No. 4.</ref> ) or about 10,000 per move. The reason why CHAOS evaluated so slowly — their programmers did a better job of [[Evaluation|evaluation]]! Because every minimax decision is made based on a single evaluation, it seemed plausible that the more accurate this number is, the better the quality of tree searching. However, that comes at the cost of missing deep combinations from brute force search, but CHAOS's [[Playing Strength|strength]]/[[Node|nodes]]-evaluated ratio was impressive. The program carried out a selective search with iterative widening, a bit different from the others. Its book contains about 10,000 lines.
<span id="Quotes"></span>
=See also=
* [[Evaluation Overlap#Chaos|Chaos]] from [[Evaluation Overlap]] by [[Mark Watkins]]
* [[Freedom#FreedomCHAOS|Freedom vs. CHAOS]]
=Forum Posts=
* [https://en.wikipedia.org/wiki/Chaos_%28cosmogony%29 Chaos (cosmogony) from Wikipedia]
* [https://en.wikipedia.org/wiki/Chaos_theory Chaos theory from Wikipedia]
* [[Videos#SunRa:Category:Sun Ra|Sun Ra]] - Cosmic Chaos, from [https://en.wikipedia.org/wiki/The_Heliocentric_Worlds_of_Sun_Ra,_Volume_Two The Heliocentric Worlds of Sun Ra, Vol. 2] (1965), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=Zu1S9U4w1p0|alignment=left|valignment=top}}
'''[[Engines|Up one level]]'''
[[Category:Mainframe]]
[[Category:Fortran]]
[[Category:Quotes]]
[[Category:Bell Quotes]]
[[Category:Boldriaan]]
[[Category:Sun Ra]]
[[Category:Acronym]]
[[Category:Mythology]]
