It is meant for beginner Go coders and beginner Go players.
|Table of contents|
This version plays random moves. Support by GnuGo is required for scoring, as well as for clearing play in case the players disagree about the final status of groups.
In this version, move generation is based on liberty counting. Scoring and clearing at the end of games are managed completely by SimpleGo, using BensonsAlgorithm. Hence, GnuGo is not needed here anymore.
Version 0.1.X is currently playing as WeakBot50k at KGS.
Version 0.2.X adds 1-2 liberty tactical search. This handles ladders and similar cases. Maybe about 20 stones stronger. Its playing as SimpleBot at KGS.
Version 0.3.x adds:
- tactical cut/connection reading for heuristical death reading
- cutting of small passageways between surrounding groups and between surrounding group and edge for killed group (only miai cutting currently)
Now it realises dead groups much earlier and sometimes kills and saves groups.
Version 0.4.x is now Monte Carlo engine using UCT search. It also is now partially written in C and uses GNU Go libboard to make and undo moves (place/remove stones from board) and other basic stuff like liberty counting and board hashing.
Patrick Traill: This page duplicates and/or conflicts with some of the information on SimpleBot'', and would be clearer and easier to keep up to date if that were merged into this page (and replaced by an alias, of course).