チェスの算法

最近自己開発のチェスプログラムと歴史上最初に成功したプログラムを比較しています。
The MacHack program used only 256K of memory and yet could play against rated players with success. The Java virtual machine which runs the chess engine I developed utilizes 18 megabytes of memory, or seventy-two times more. My program scans over 3000 moves for a single ply, which seems highly excessive. Some differences between my algorithm and MacHack include:
1. no alpha-beta pruning in my search
2. no hash table in mine
3. No search width constraint.
4. Lack of a plausible move generator (although legality is checked) or opening book.
違う所があるけれど似ている所もあります。
1. Recursive, depth-first game tree search
2. Bound on depth of exploration.
3. Assignment of point values to pieces for static board analysis.