25,161
edits
Changes
no edit summary
<ref>[[Alexander Szabo]] ('''1984'''). ''[https://open.library.ubc.ca/cIRcle/collections/ubctheses/831/items/1.0051870 Computer-Chess Tactics and Strategy]''. M.Sc. Thesis, [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia]</ref>.
MateTech performs an [[Alpha-Beta|alpha-beta search]] with [[Quiescence Search|quiescence]] and [[Iterative Deepening|iterative deepening]] with [[Aspiration Windows|aspiration windows]] , using a [[Transposition Table|transposition table]] with [[Zobrist Hashing|Zobrist hashing]].
The pure [[Material|material]] based rudimentary [[Evaluation|evaluation]] of Tech 3 was extended by a strategic component <ref>[[Alexander Szabo]], [[Barbara Szabo]] ('''1988'''). ''The Technology Curve Revisited''. [[ICGA Journal#11_1|ICCA Journal]], Vol. 11, No. 1]]</ref>.<span id="TechnologyCurve"></span>
=The Technology Curve=
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 [[Alexander Szabo|Alexander]] and [[Barbara Szabo ]] [[Alexander Szabo#TechnologyCurveRevisted|revisited ]] the '''[[Alexander Szabo#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 machines and algorithms become more powerful. [[Ernst A. HeinzHardware|machines]] 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#DiminishingReturnsAlgorithms|diminishing returnsalgorithms]] at longer search times. However, the Szabos simply did not play enough games at long times to draw reliable conclusionsbecome more powerful.
=Publications=
* [https://www.atarimagazines.com/index/index.php?author=Harvey+Bernstein&mag=antic Harvey Bernstein] ('''1987'''). ''[https://www.atarimagazines.com/startspe1/entertainment.html Entertainment - Strategy, adventure, shoot-em-ups, chess and simulations]''. [https://www.atarimagazines.com/index/?issue=startspe1 STart Special Issue Number 1]
* [[Christopher Chabris]] ('''1987'''). ''[https://www.atarimagazines.com/startv2n2/chess.html Reviews: The Game of Kings - START's First Chess Tournament]''. [https://www.atarimagazines.com/index/?issue=startv2n2 STart Vol. 2, No. 2]
* [[Alexander Szabo]], [[Barbara Szabo]] ('''1988'''). ''The Technology Curve Revisited''. [[ICGA Journal#11_1|ICCA Journal]], Vol. 11, No. 1]]
=External Links=
'''[[Engines|Up one level]]'''
[[Category:Commercial]]
[[Category:Atari ST]]
[[Category:68000]]
