Changes

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.