Discussion about chess-playing software (engines, hosts, opening books, platforms, etc...)
-
Peter C
- Posts: 154
- Joined: Thu Jun 10, 2010 3:12 am
- Real Name: Peter C
Post
by Peter C » Sat Jan 08, 2011 3:08 am
New release for SF 2.0.1
Changes:
- All the changes in the regular Stockfish 2.0.1
- tbhits are now sent to the GUI
- ProbeOnlyAtRoot is now false by default because it doesn't work well. Turn it on to double the NPS, though tablebases might not work well (it's a bit finicky).
- GaviotaTbCache is now 32MB by default, I thought 128MB was a bit high
- My compile doesn't require extra DLLs anymore.
At some point I might make the TB probing better/more efficient/less buggy. What's a good engine to study for implementing (Gaviota) EGTBs?
Anyway, here's the download, with the source and a hopefully fast 32-bit Windows executable:
http://www.mediafire.com/?6e5x82t7l1xyt6i
The Makefile might be MinGw-specific, so if you're compiling it yourself you may have to alter the LDFLAGS variable. Sorry about that.
Peter
-
Trahald
- Posts: 1
- Joined: Sat Jan 08, 2011 4:11 am
- Real Name: Russell Murray
Post
by Trahald » Sat Jan 08, 2011 4:21 am
Hello Peter,
Thank you for your efforts with this, they are much appreciated.
The Gaviota website contains a list of engines (and GUI's) which support Gaviota tablebases. Of these, both Daydreamer and Umko are open source, so I would suggest starting there.
Best regards
Russell
-
Peter C
- Posts: 154
- Joined: Thu Jun 10, 2010 3:12 am
- Real Name: Peter C
Post
by Peter C » Sat Jan 08, 2011 5:19 am
Thanks, I'll check them out.
Peter
-
Peter C
- Posts: 154
- Joined: Thu Jun 10, 2010 3:12 am
- Real Name: Peter C
Post
by Peter C » Sat Jan 08, 2011 7:36 pm
I have (for my 1.9 version). IIRC, it's missing some header files that Stockfish uses. I might give it another try, or I might use VC++ 2010 w/ Windows 7 SDK.
Peter
-
Peter C
- Posts: 154
- Joined: Thu Jun 10, 2010 3:12 am
- Real Name: Peter C
Post
by Peter C » Sun Jan 09, 2011 3:50 am
In about 24h 40m, this thing has been downloaded 130 times! Thanks everyone!
Of course, if it becomes too popular, I might actually have to do some work on it and make the probing better....
Peter