Woodpusher
チームメンバー
参加回数
| Version | トーナメント | 参加者 | 得点 | 試合数 |
|---|
| Woodpusher 1997 | チェス, 2011, ティルブルフ | 9 | 0.0 | 8
|
| チェス (Blitz), 2011, ティルブルフ | 6 | 0.0 |
|
| WoodPusher 1997 | チェス, 2004, ラマット・ガン | 14 | 3.0 | 11
|
| チェス, 1997, パリ | 34 | 5.0 | 11
|
| チェス, 1996, ジャカルタ | 27 | 5.5 | 11
|
| チェス, 1995, シャーティン | 24 | 1.0 | 5
|
| チェス, 1992, マドリッド | 22 | 3.0 | 5
|
| チェス, 1992, ロンドン | 7 | 3.0 | 7
|
| チェス, 1991, バンクーバ | 15 | 2.5 | 7
|
| チェス, 1990, ロンドン | 11 | 4.0 | 7
|
| チェス, 1989, ロンドン | 9 | 0.5 | 8
|
Description
Description given in 1995:
Woodpusher is a small chess program (< 64K) of conventional design. It uses an iterative deepening alpha-beta search with PVS and aspiration window enhancements. The first version of Woodpusher was born in 1989 as part of a university project looking into null-move search techniques. True to it's origins, this new version of the program still uses the null-move throughout the search to recognize threats and to forward prune branches of the search tree. A database of attacks from and to all the squares on the board is maintained by using CHESS 4.5's bit-board implementation. These data structures are used for both generating moves and making positional evaluations. Woodpusher's position evaluation is maintained almost entirely incrementally while making and un-making moves during the search, with very little work done at the terminal nodes. The evaluation is therefore necessarily simple, but does include true measures of mobility rather than relying on piece-square evaluations.