Search found 161 matches

by vladstamate
Tue Jul 14, 2009 6:30 pm
Forum: Computer Chess Club: General Topics
Topic: STS (v4.0) - "Square Vacancy"
Replies: 65
Views: 4659

Re: STS (v4.0) - "Square Vacancy"

At 10sec per position, Plisk gets 44 correct answers out the 100. Correct: 44 Wrong: 56 Percent: 44% This was in Linux, using a 32bit compile of the engine running on 1CPU with 128Mb hash. The processor was a P4D 3.0Ghz. Btw, I really appreciate the effort you (and Dann Corbit) put into the STS. The...
by vladstamate
Wed Jun 24, 2009 8:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: pulsar and analysis mode
Replies: 7
Views: 795

Re: pulsar and analysis mode

adams161 wrote: Its playing on icc but as it goes for computer accounts its slow to get games. maybe one or two an hour.
My engine, Plisk, plays on FICS and I get about 10 games an hour. This is on a registered computer account.

Vlad.
by vladstamate
Mon Jun 22, 2009 9:33 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Incremental Zobrist - slow?
Replies: 22
Views: 3935

Re: Incremental Zobrist - slow?

What about chars? If you use those, the math will be done as bytes, and then have to be extended to a longer value for use as a subscript or address offset. Ah yes! I do have lots of those in the Move structure. I figured I save space. But if the compiler has to generate that kind of code to deal w...
by vladstamate
Mon Jun 22, 2009 1:11 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Incremental Zobrist - slow?
Replies: 22
Views: 3935

Re: Incremental Zobrist - slow?

Strange thing is I do not have any bitfields anywhere in my code. Only normal structures. I have no idea why would the compiler generate code like that.

Regards,
Vlad.
by vladstamate
Sun Jun 21, 2009 12:31 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Incremental Zobrist - slow?
Replies: 22
Views: 3935

Re: Incremental Zobrist - slow?

Hi, Yes you were both right. Null-move was definitely a place that I had forgotten about. Also the castling rights are quite tricky to follow. However I have now fixed all the bugs and the search really got a speed boost. I went from around 1.1knps to 1.6knps, so almost 50% increase. Thank you all f...
by vladstamate
Sat Jun 20, 2009 8:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Incremental Zobrist - slow?
Replies: 22
Views: 3935

Re: Incremental Zobrist - slow?

This should not be possible. The differential update just does three times what a full key calculation does 32 times, and you likely do call the full key calculation after every MaeMove(), to do the hash probe. Are you sure the differential update produces exacty the same key as the full calculatio...
by vladstamate
Sat Jun 20, 2009 5:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Incremental Zobrist - slow?
Replies: 22
Views: 3935

Re: Incremental Zobrist - slow?

Hi Gerd, Yes you are right. A closer look at the code (from bottom up) it looks like there are 2 64bit xors plus about another 10-12 instructions for setting up the rax,rdx offset registers. So indeed, not as many instructions I've listed there. I will work on "compressing" the arrays by making them...
by vladstamate
Sat Jun 20, 2009 4:56 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Incremental Zobrist - slow?
Replies: 22
Views: 3935

Re: Incremental Zobrist - slow?

Here is the assembly obtained using a "release", hence optimized build for x64 arhitecture. I double checked the compile flags and all optimizations seem to be turned on. It seems to generate an awful lot of code for 2 xors and 2 memory address calculation (albeit yes, they do need multiplications)....
by vladstamate
Sat Jun 20, 2009 4:00 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Incremental Zobrist - slow?
Replies: 22
Views: 3935

Incremental Zobrist - slow?

Hi all, I hit a bit of a wall regarding speed of Zobrist key/hash management. For a long time my program generated the entire hash for a given board from scratch (when needed, like for rep detection - every makeMove and for evaluation). I decided to improve that and take advantage of the Zobrist key...
by vladstamate
Thu Jun 18, 2009 7:35 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI engine with adjustable elo, piece values, mobility, etc.
Replies: 9
Views: 1454

Re: UCI engine with adjustable elo, piece values, mobility,

JVMerlino wrote:Unless something has happened recently, The King does not support UCI (at least, not without conversion programs in between The King and the GUI).

jm
I can confirm that it does not indeed work. I've tested it against Arena and it could not respond to any UCI commands.

Vlad.