Difference between revisions of "Tech"

From Chessprogramming wiki
Jump to: navigation, search
Line 81: Line 81:
'''[[Engines|Up one Level]]'''
'''[[Engines|Up one Level]]'''

Latest revision as of 10:48, 27 September 2020

Home * Engines * Tech

The Technology Chess Program,
abbreviated Tech, was one of the predecessors of modern chess programs, using a Shannon Type A Strategy. In 1970 Tech was written in BLISS, a system programming language developed at Carnegie Mellon University, and in 1977 ported to C. Primary Author was James Gillogly from Carnegie Mellon. Hans Berliner helped in developing the positional analysis (evaluation). The basic idea of the Tech program is due in large part to Allen Newell. In 1978 Gillogly wrote his Ph.D. Thesis about the performance analysis of Tech [2]. Tech competed at three ACM North American Computer Chess Championships, and was two times runner-up at ACM 1971 and ACM 1972.


Quotes from The Technology Chess Program by James Gillogly [3].


A chess program has been developed which plays good chess (for a program) using a very simple structure. It is based on a brute force search of the move tree with no forward pruning, using material as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal. Because of the transparent structure, this program is proposed as a technological benchmark for chess programs which will continue to improve as computer technology increases.

Chess and Technology

Until recently the main effort in chess programming has been to develop programs which selectively (and hopefully "intelligently") examine a small subset of the legal moves in any position. The surprising performance of the Varian minicomputer (programmed by K. King and C. Daly) in the First Annual Computer Chess Championship (New York 1970), although due primarily to good luck in the pairings, led to increased speculation about the possibility of playing respectable chess with an unselective "brute force" program.


I am indebted to Hans Berliner, World Correspondence Chess Champion, who developed the elegant techniques used in the positional analysis, and whose patient discussion helped to clarify many of the conceptional problems. The basic idea of the Technology Program is due in large part to Allen Newell.

Selected Games

ACM 1971, round 3, Coko 3 - Tech [4]

[Event "ACM 1971"]
[Site "Chicago USA"]
[Date "1971.08.04"]
[Round "3"]
[White "Coko 3"]
[Black "Tech"]
[Result "0-1"]

1.e4 e5 2.Nf3 Nc6 3.Bc4 Nf6 4.d3 d5 5.Bxd5 Nxd5 6.exd5 Qxd5 7.Nc3 Bb4 8.O-O Bxc3 
9.bxc3 O-O 10.Ng5 Bf5 11.Rb1 f6 12.c4 Qc5 13.Nh3 Bxh3 14.Be3 Nd4 15.gxh3 Qc6 16.c3 
Nf3+ 17.Kh1 Nd2+ 18.f3 Nxf1 19.Qxf1 f5 20.Rb5 f4 21.Rc5 Qe6 22.Bc1 c6 23.d4 Rae8 
24.Rxe5 Qg6 25.Rxe8 Qxe8 26.Qf2 Qe6 27.Qf1 Rf5 28.h4 c5 29.d5 Qd6 30.Qh3 Qe5 31.Qf1 
Qxc3 32.d6 Qd4 33.Qe2 Qxd6 34.Qe8+ Rf8 35.Qa4 Rf5 36.Qe8+ Rf8 37.Qa4 Qe6 38.Qb3 Qe2 
39.h3 Rd8 40.Bxf4 Rd1+ 0-1

Tech 2

MIT-student Alan Baisley, who already contributed as chess expert and opening book-author, implemented Tech 2 in assembly language on a PDP-10 and gained about 25% in speed over the BLISS version on the same machine [5]. Tech 2 competed at the 1st World Computer Chess Championship in Stockholm 1974 and became fifth with two wins and losses against Kaissa and Chess 4.0 [6], placed second at the ACM 1973, and further played the ACM 1974 [7] .

Tech 3

Tech 3 was an own program in the spirit of Tech by Alexander Szabo as subject of his Masters thesis at University of British Columbia in 1984. Tech 3 performed a brute force alpha-beta search with quiescence and iterative deepening with aspiration windows , using a transposition table with Zobrist hashing, and still the rudimentary evaluation only based on material balance. Tech 3 was written in Fortran and IBM 370 Assembly to run on a Amdahl 470V/8, the source code listing is given in Appendix 1 of the thesis [8].

See also


External Links

Chess Program



Up one Level