![]() StartingPoints Referenced by
|
Kombilo
Kombilo is a very fast search engine for sgf files. It is freeware. It is written in Python and therefore requires that you have the Python interpreter installed on your PC (or be willing to install it :-). This is definitely worth doing if you want to study games and you have (or plan to acquire) a lot of sgf files. On my old Pentium 166, Kombilo will do a pattern search across the 14,000 GoGoD CD games in about 40 seconds. On my wife's Celeron-powered laptop it takes about 8 seconds. The result is:
You can click on any game in the list and view the basic game info or double click and a viewer will pop up to quickly review the game. If you use Kombilo with the GoGoD CD, the listing is an instant history of the variation you are studying. This is because the game names in the CD collection are composed of the dates on which the games were played. You can see at a glance when the variation was popular and whether it is still used.
BillSpight: Thanks for the info, Dave. :-)
anywhere in the center of the board,
Jan de Wit: Hi Bill, I think (from the website) that the program takes both color and position symmetries into account when searching, and you can selectively disable each of them. UliGo, the other program by Ulrich Goertz is very nice too - it teaches problems (mainly life and death), also rotating and inverting them. Now if I could only get round to entering all the problems in Graded Go Problems for Beginners and Tesuji... Ulrich Goertz: Jan is right; the program does take symmetries, color swap and translations into account (you can optionally disable color swap and translations). Bill: Great! Thanks, Jan. And many thanks to you, Ulrich, for making such valuable go software available. :-)
Ulrich Goertz: The next version of Kombilo is ready now, and is available for download from By the way, there is now also an installer for Windows, which makes it unnecessary to install Python separately. This is a copy of the living page "Kombilo" at Sensei's Library. (C) the Authors, published under the OpenContent License V1.0. |