Changes

which compares favourable with [[Belle|Belle's]], considering machine power. He developed a Alex Szabo used the '''Technology Curve'' ' as introduced by [[James Gillogly]] <ref>[[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>, a graph of [[Playing Strength|playing strength]] versus machine power aka [https://en.wikipedia.org/wiki/Binary_logarithm binary logarithm] of [[Nodes per Second|nodes per second]], as a tool for measuring the effectiveness of [[Knowledge|knowledge ]] encoding, and found in this respect [[Nuchess]] as the best chess program of that time <ref>[[Alexander Szabo]] ('''1984'''). ''[https://circle.ubc.ca/handle/2429/24780 Computer-Chess Tactics and Strategy]''. M.Sc. Thesis, [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia]</ref>.

<span id="TechnologyCurveRevisted"></span>=The Technology CurveRevisted=As published in their 1988 [[ICGA Journal|ICCA Journal]] paper <ref>[[Alexander Szabo]], [[Barbara Szabo]] ('''1988'''). ''The Technology Curve Revisited''. [[ICGA Journal#11_1|ICCA Journal, Vol. 11, No. 1]]</ref>, Alex and Barbara Szabo revisited the [[TechMate #TechnologyCurve|Technology Curve]] by playing 6882 games between copies of TechMate set at different time rates, with the conclusion that the advantage of improved technology rapidly decreases when [[Hardware|machines]] and [[Algorithms|algorithms]] become more powerful. [[Ernst A. Heinz]] in his self-play memo on the experiment of the Szabos <ref>[[Ernst A. Heinz]] ('''2000'''). ''A New Self-Play Experiment in Computer Chess''. [[Massachusetts Institute of Technology]], Laboratory of Computer Science, Technical Memo No. 608, [http://supertech.lcs.mit.edu/~heinz/ps/new_exp.ps.gz zipped ps], [http://bitsavers.trailing-edge.com/pdf/mit/lcs/tm/MIT-LCS-TM-608.pdf pdf]</ref>: The Szabos determined the technology curve of their chess program TechMate that self-played 6,882 games on two Atari ST computers. The number of games per match between longer and shorter searching versions of the program varied strongly from a minimum of 32 to a maximum of 1367. The gain in playing strength averaged at 156 rating points per doubling of available search time (computing power). The experimental data indicated slight [[Depth#DiminishingReturns|diminishing returns]] at longer search times. However, the Szabos simply did not play enough games at long times to draw reliable conclusions.

<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|ICGA Reference Database] (pdf)]</ref>