Search found 522 matches

by AndrewGrant
Fri Jun 10, 2016 12:28 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fix a bug created by Aspiration Windows->Massive ELO loss
Replies: 13
Views: 2251

Re: Fix a bug created by Aspiration Windows->Massive ELO

Are you defining a repetition as the position occurring twice? I've only been assigning draw scores to positions that hit 3 repetitions. Never thought about this.... I suppose I should be using draw scores for positions that occur twice... not thrice. I suppose I should never even being storing tran...
by AndrewGrant
Thu Jun 09, 2016 11:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fix a bug created by Aspiration Windows->Massive ELO loss
Replies: 13
Views: 2251

Fix a bug created by Aspiration Windows->Massive ELO loss

Hey, I recently implemented a very simple Aspiration Window wrapper around the root of the search. After running my test sets I found a ~30 ELO gain and committed the changes. I then discovered a bug with how I was storing Transposition Entries in the root search, now that the bounds are not always ...
by AndrewGrant
Wed Jun 08, 2016 1:59 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Aspiration Windows on the root search -- Determining margin
Replies: 2
Views: 1516

Aspiration Windows on the root search -- Determining margin

I've just now got around to adding a basic Aspiration window wrapper around my rootSearch function. in pseudo code, it is something like this.. for (margin = 30; margin < 250; margin *= 2) alpha = lastScore - margin; // lastScore is from previous draft beta = lastScore + margin; I'm aware that I mig...
by AndrewGrant
Fri Jun 03, 2016 6:41 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Computing hash "on the fly"
Replies: 20
Views: 3147

Re: Computing hash "on the fly"

Your original post claimed to make nps gains. If that is not the case, was is your objective in using a different hashing method?
by AndrewGrant
Fri Jun 03, 2016 2:32 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Time controls for testing for 40/4
Replies: 3
Views: 781

Time controls for testing for 40/4

Up until now my testing procedure has been highly unorganized. My tests are, at best, a 100game test versus another engine in 40moves in 4 minutes time controls. This is problematic because 100games at this time control takes hours and hours (Was testing in Arena). I now have cutechess-cli set up an...
by AndrewGrant
Fri Jun 03, 2016 1:02 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Computing hash "on the fly"
Replies: 20
Views: 3147

Re: Computing hash "on the fly"

I HIGHLY doubt that you are out performing Zorbist. Meaning one of a couple things... 1) Your Zorbist implementation is poor 2) Your testing scheme is bad. Changing the hash signatures changes how your table affects your search. To measure the performance of your Hashing method you need to disable t...
by AndrewGrant
Mon May 30, 2016 11:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Divide/perft question
Replies: 4
Views: 1231

Re: Divide/perft question

By Divide do you mean; Show PERFT counts for EACH initial move? If that is the case, StockFish does this.
by AndrewGrant
Tue May 24, 2016 11:34 pm
Forum: Computer Chess Club: General Topics
Topic: What are your favorite chess engine names?
Replies: 26
Views: 5562

Re: What are your favorite chess engine names?

I've always really loved the name Crafty. I'm not sure if it is a great name or if I have just spent too many hours reading the source. Houdini will always be my favorite however. I also really like MicroMax. It's pretty simple but I love the play on words with miniMax and Micro because of it's size.
by AndrewGrant
Fri May 20, 2016 9:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Dynamic chess
Replies: 2
Views: 900

Re: Dynamic chess

I highly doubt this would stop your from losing ELO, but the best idea I know of is asymmetrical evaluation. Gives your evaluations weights, such that you could care more about your pawn structure than your opponent. Or maybe you want to play more aggressive so you increase the value of your rooks b...
by AndrewGrant
Mon May 16, 2016 9:56 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Asperger only
Replies: 8
Views: 1453

Re: Asperger only

Ran it through my engine quickly... results... info depth 1 score cp 328 time 0 nodes 139 pv e2f2 info depth 2 score cp 328 time 0 nodes 518 pv e2g2 info depth 3 score cp 338 time 0 nodes 1022 pv e2g2 info depth 4 score cp 338 time 0 nodes 2958 pv e2g2 info depth 5 score cp 341 time 0 nodes 7461 pv ...