Betsy

From Chessprogramming wiki
Jump to: navigation, search

Home * Engines * Betsy

Hurricane Betsy [1]

Betsy,
a WinBoard compatible chess engine by Landon Rabern, written in C with a little Assembly, released in September 2000 [2]. Originally written in Pascal with its own text interface it was rewritten in C using rotated bitboards. Betsy applies PVS with null move pruning, and various standard and some aggressive non-standard extensions and reductions. According to a former Arena site, Betsy was the first published chess engine able to play Chess960 [3], and was therefore Arena partner engine.

Neural Networks

Quote by Landon Rabern [4]

As a child, I was obsessed with machine intelligence. I coded a strong chess AI (codenamed Betsy) and experimented with using neural networks in Betsy, both for the static evaluation at leaf nodes and within the tree for pruning. The networks learned from self-play to get about as good as my hand-tuned functions (discounting the slowdown incurred by sigmoid evaluation). I concluded that to do better, I would need to use raw game state data instead of the set of features I preselected as network inputs; unfortunately, this was 2000 and I did not have nearly enough processing power to do so.

C# Port

As of 2014, Landon Rabern started to port Betsy to C#, available as open source engine under the MIT License at GitHub. All the major components of a chess engine are there, just not a tuned evaluation [5]. The board class embeds an 8x8 board and the Bitboard board-definition, and implements rotated bitboards. The search is implemented using a derivation chain of classes, the abstract base Brain, TranspositionTableBrain (Transposition Table, Iterative Deepening), and the concrete BasicAlphaBetaBrain (Alpha-Beta), NullMoveBrain (Null Move Pruning) and MTDfBrain (MTD(f)) classes.

Forum Posts

External Links

Chess Engine

Misc

References

Up one Level