|
Hotbabe Chess has the least features of any chess program around. No clocks,
no timers, no analysis, no sounds, no fancy piece bitmaps. It's also
a fairly easy chess engine to beat.
-
Chess Interface: Easy to use chess interface
-
Hotbabe Character: humorous hotbabe opponent
-
Browse Chess History: Scroll thru the history of moves during gameplay.
-
Undo: Undo one or more moves during gameplay
-
Hint: Ask hotbabe for a hint.
-
Flip Board: Flip chess board to see the black pieces on the bottom.
-
Save/Load Games: Save or Load a game in progress
-
Current Game: Hotbabe remembers the current game, and automatically
resumes the last game you were playing next time you run Hotbabe Chess.
-
20 Skill Levels: Skill levels 1, 2, 3, and 4 are fairly easy to beat for
total beginners. The remaining levels give the computer 5 to 60 seconds of thinking
per move.
Performance:
The chess engine will search about 260,000 nodes per second
on a 2.6 Ghz pentium. A 1.0 Ghz computer produces about 150,000 nodes per second.
A 1.5 Ghz computer produces about 175,000 nodes per second.
The chesss engine features:
- Transposition table with about 1,000,000 entries.
- Zobrist hashing key algorithm.
- Iterative deepening (the principle continuation from each depth
is fed back into the search for depth+1).
- Primary search algorithm is Alpha-beta
- Move ordering for the normal search is captures first, then normal moves.
- Move ordering for the captures is: MVV/LVA
- One Killer move retained for each ply.
- Non-capture moves are ordered using the move history heuristic.
- Queiscent search extension (captures, castling and promotions)
- Evaluation function incorporates material advantage and
a very simple positional scoring based on where certain pieces
are located on the board.
- Move generation uses a large array indexed by pieces and squares that yields
a list of "paths" to examine for valid moves. In-check detection uses
a similar table.
- Repetition detection.
|
