Difference between revisions of "Gerbil"

From Chessprogramming wiki
Jump to: navigation, search
Line 4: Line 4:
  
 
'''Gerbil''',<br/>
 
'''Gerbil''',<br/>
an [[Open Source Engines|open source chess engine]] under the [[Free Software Foundation#GPL|GNU General Public License]] <ref>[http://web.archive.org/web/20070607151211/www.brucemo.com/compchess/gerbil/index.htm Gerbil] by [[Bruce Moreland]] archived by the [https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine]</ref>, written by [[Bruce Moreland]], written for educational purposes. It has a decent search ([[Null Move Pruning|null move pruning]], [[Transposition Table|hash tables]]) but a rudimentary [[Evaluation|evaluation]] <ref>[http://web.archive.org/web/20070602233810/http://www.seanet.com/~brucemo/gerbil/release.txt Release Notes 02] archived by the [https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine]</ref>.  
+
an [[:Category:Open Source|open source chess engine]] under the [[Free Software Foundation#GPL|GNU General Public License]] <ref>[http://web.archive.org/web/20070607151211/www.brucemo.com/compchess/gerbil/index.htm Gerbil] by [[Bruce Moreland]] archived by the [https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine]</ref>, written by [[Bruce Moreland]], written for educational purposes. It has a decent search ([[Null Move Pruning|null move pruning]], [[Transposition Table|hash tables]]) but a rudimentary [[Evaluation|evaluation]] <ref>[http://web.archive.org/web/20070602233810/http://www.seanet.com/~brucemo/gerbil/release.txt Release Notes 02] archived by the [https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine]</ref>.  
  
 
=Features=
 
=Features=

Revision as of 14:33, 26 June 2018

Home * Engines * Gerbil

A Young Gerbil [1]

Gerbil,
an open source chess engine under the GNU General Public License [2], written by Bruce Moreland, written for educational purposes. It has a decent search (null move pruning, hash tables) but a rudimentary evaluation [3].

Features

Bruce on Gerbil [4]:

  1. It is using 0x88 move generation. The function is something under 200 lines long, which seems big, but there are a lot of comments and there's some repeated code.
  2. It is using vanilla windowed alpha-beta with no PVS or anything like that, and I plan to keep it this way, since that is clear and performs acceptably.
  3. It has a check extension. I think that is enough for now. I may try to do some pruning in the quiescence search, which uses MVV/LVA. I don't plan to write a static exchange evaluator.
  4. This is already a more or less fully functional winboard engine, an effort that consumed a whole bunch of time, not that Mann's standard is hard to write to. I just had to spend a lot of time messing with threads.

Legal derivatives

See also

Forum Posts

External Links

Chess Engine

Misc

References

Up one Level