Editing Computer chess (section)

=== Later software age: full-width search ===
One developmental milestone occurred when the team from [[Northwestern University]], which was responsible for the [[Chess (Northwestern University)|Chess]] series of programs and won the first three [[Association for Computing Machinery|ACM]] [[World Computer Chess Championship#ACM|Computer Chess Championships]] (1970–72), abandoned type B searching in 1973. The resulting program, Chess 4.0, won that year's championship and its successors went on to come in second in both the 1974 ACM Championship and that year's inaugural [[World Computer Chess Championship]], before winning the ACM Championship again in 1975, 1976 and 1977.  The type A implementation turned out to be just as fast: in the time it used to take to decide which moves were worthy of being searched, it was possible just to search all of them. In fact, Chess 4.0 set the paradigm that was and still is followed essentially by all modern Chess programs today, and that had been successfully started by the Russian ITEP in 1965.