Changes

Clearly, Richard Lang has produced the strongest microcomputer program in the world. It searches 4-5 plies [[Brute-Force|brute force]] plus up to 6-7 plies [[Selectivity|selective search]]. The program contains a lot of [[Knowledge|chess knowledge]], which is used both in the [[Search Tree|tree]] and to create [[Piece-Square tablesTables|piece-value-tables]]. The chess knowledge was obtained from chess masters, who analyzed games played by the program. The program has an [[Asymmetric evaluationEvaluation|asymmetric evaluation]] function, which emphasis safety (has rules like 'do not start a wild attack, but worry a lot if the opponent does so'). The program searches about 4000 [[Nodes per secondSecond|nodes per second]] on a 28 MHz [[68020]], but this includes a thorough analysis at every node, including a [[Static Exchange Evaluation|swap-off evaluation]] (static analysis of captures instead of a [[Quiescence Search|capture search]]).