Page 4 of 4

Re: Current world's smallest chess program

Posted: Fri Feb 27, 2009 12:05 pm
by Jim Ablett
Denis P. Mendoza wrote:
Jim Ablett wrote:
Please, Jim, could you also replace the source in your Toledo_nanochess zip download by this version? There is no need to recompile, the removal of an unused global variable should have no effect on the executable.
Done.

New download link:
http://www.mediafire.com/?ojn4ejmhx0z

Jim.
Jim,

I can't seem to download this file using the link given. Thanks.

Denis
Mirror:
http://www.live-share.com/files/382372/ ... l.zip.html

Jim.

Re: Current world's smallest chess program

Posted: Fri Feb 27, 2009 6:57 pm
by nanochess
I was talking about PGN of this match. Also, could someone point me to the nunn.pgn file?
hgm wrote:I tried a Nunn match between micro-Max 1.6 and Toledo_nanochess. (Yes, the protocol of this new Toledo does support force mode, so you can play it with an external book!) To make for approximately fair CPU time usage I set uMax to 500,000 nodes (minimum) and Toledo-nC to 4 ply. (This requires altering of the source and re-compilation; the standard version of Toledo-nC is set for 5 ply.) This sets the programs to blitz speed.

It seems the programs are well matched at this speed (5+, 11=, 4- in the advantage of uMax). As both programs cannot recognize repeats, there are a lot of unnecessary draws. The worst cases of this were uMax not being able to win in KRBPPPPPK, and Toledo not being able to win KQKP (with a 4th-rank Pawn...). It is difficult to design compltely air conditions, as Toledo-nC uses fixed-depth, and uMax plays by node-count. So Toledo-nC tends to think longer in the middle-game, but then completely catches up in the end-game. In the end one of the two is likely to have used much more time than the other, (typically twice as much), but who that is depends on when the Queens were traded, and if there was a quick mate or a tedious end-game.

Nevertheless, they play purposefully, and both are able to win games. 8-)

Re: Current world's smallest chess program

Posted: Sat Feb 28, 2009 7:07 pm
by Denis P. Mendoza
Jim Ablett wrote:
Denis P. Mendoza wrote:
Jim Ablett wrote:
Please, Jim, could you also replace the source in your Toledo_nanochess zip download by this version? There is no need to recompile, the removal of an unused global variable should have no effect on the executable.
Done.

New download link:
http://www.mediafire.com/?ojn4ejmhx0z

Jim.
Jim,

I can't seem to download this file using the link given. Thanks.

Denis
Mirror:
http://www.live-share.com/files/382372/ ... l.zip.html

Jim.
Thanks Jim. got tit this time :wink: !

Re: Current world's smallest chess program

Posted: Sat Feb 28, 2009 7:27 pm
by hgm
nanochess wrote:I was talking about PGN of this match. Also, could someone point me to the nunn.pgn file?
The Nunn.pgn is included in the WinBoard Gold Pack, which is available for download from the WinBoard forum. ( http://www.open-aurec.com/wbforum/viewt ... 19&t=49439 )

It mut be available as a smaller download somewhere, but I forgot where I got it from.

Re: Current world's smallest chess program

Posted: Sat Feb 28, 2009 8:21 pm
by ernest
hgm wrote:It mut be available as a smaller download somewhere, but I forgot where I got it from.
The WinBoard Gold Pack contains the Nunn2 (20 opening positions) file.
Both Nunn2(20) and Nunn1(10) files can be found at Kurt Utzinger's site:

http://www.utzingerk.com/test.htm

Re: Current world's smallest chess program

Posted: Mon Mar 16, 2009 3:49 pm
by nanochess
Update, Toledo Nanochess now is 3 characters smaller, 30% faster and corrects two bugs: one is handling of special cases of castling (detected when I runned a Nunn match), the other is the crash under Cygwin (cannot call main recursively), this also makes main compliant with the standard int main(void). 8-)

I uploaded to my site the results of the Nunn match versus Micromax v1.6, +5 =11 -4 in advantage for Toledo Nanochess. Both programs in factory-default settings.

Re: Current world's smallest chess program

Posted: Mon Mar 16, 2009 4:05 pm
by hgm
Meaning that Toledo_nanochess thinks 20 times longer than micro-Max? :roll:

OK, I admit that Toledo_nanochess must play a quite reasonable game to be able to achieve this result even at such time odds. (Which is a fantastic acheivement for a program that could be printed on a stamp. Don't bother designing a logo, just use the source code in small font! :lol: ) But it does seem a bit misleading...