Search found 16745 matches

by bob
Wed Jul 12, 2017 4:28 am
Forum: Computer Chess Club: General Topics
Topic: Komodo and WCCC
Replies: 114
Views: 17716

Re: Komodo and WCCC

I agree Stockfish should be allowed to partecipate. The official Stockfish 8 could be 10 ELO stronger than Komodo. And the fact Marco started this winning project severals years ago makes me feel proud to be Italian. But rules are rules. They are unfair, but still rules. To let the event dies in si...
by bob
Sat Jul 08, 2017 4:13 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Core behaviour
Replies: 34
Views: 6842

Re: Core behaviour

I would NEVER consider testing under windows. I want a tightly controlled environment that will work consistently each and every time. I understand your concerns, but believe me, you can test on Windows and works more than reasonably well :-) Sorry, but not even close. And if you are talking window...
by bob
Fri Jul 07, 2017 4:37 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Core behaviour
Replies: 34
Views: 6842

Re: Core behaviour

I was really thinking of testing done by OTHERS when I was writing that. In my case, with my own testing, I very carefully set up a testbed that introduced as little noise as possible. But when the testing goes outside of my reach. Such as SSDF, TCEC, and all the other events and tests run by others...
by bob
Tue Jul 04, 2017 12:02 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Core behaviour
Replies: 34
Views: 6842

Re: Core behaviour

My take here is that there is little use in worrying about something you can't fix. A process can always spawn 99 cpu burners that are quiet when the engine is searching, burning cycles when the opponent is searching. You can do similar things to blow out cache when running on a single machine. At s...
by bob
Sun Jul 02, 2017 3:37 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Core behaviour
Replies: 34
Views: 6842

Re: Core behaviour

UPDATE I have been fiddling with affinity. I have a match running against a 50 elo stronger engine and yet I get a 62.5% score representing and increase of 140 elo (50+90). Nice cheat! I suppose you can do it with: SetThreadAffinityMask in an engine and damage your opponent. To be continued. Window...
by bob
Sun Jul 02, 2017 3:32 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: multiple iterations giving same first move of PV
Replies: 4
Views: 982

Re: multiple iterations giving same first move of PV

I recall a time-savings technique (Hyatt/Crafty/Cray Blitz?) involving terminating the search early due to a number of iterations of iterative deepening giving the same first move (or something vaguely similar.) Anyone recall the greater specifics? I do something like this, as did Don (Komodo). We ...
by bob
Fri Jun 23, 2017 5:03 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash table
Replies: 36
Views: 7100

Re: Hash table

For me, I first try to overwrite the entry with a matching signature, if such exists. Second I overwrite the entry with the shallowest depth where age is different from current age. Finally, I overwrite the entry with the shallowest depth, period. IE this is a staged "always store" type of algorith...
by bob
Fri Jun 23, 2017 5:01 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: (I)ID and PV dropout
Replies: 9
Views: 1922

Re: (I)ID and PV dropout

It might defer the problem, but it won't cure it as you have to use an always store approach or the search will simply stall. And the minute you erase one of these critical entries, you set up for a never-ending iteration loop where the best move fails low, you restart, and eventually that move fail...
by bob
Fri Jun 23, 2017 12:04 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash table
Replies: 36
Views: 7100

Re: Hash table

Hello. I'm trying to improve again the main hash table, and specifically I'm trying to find which of the standard parameters are the most important and which less, to decide which of the 4 entries in any hash position is the best to be overwritten when the 4 are occupied. So for each entry I have t...
by bob
Thu Jun 22, 2017 10:39 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: (I)ID and PV dropout
Replies: 9
Views: 1922

Re: (I)ID and PV dropout

In a perfect world, the ideal strategy would be to start at ply=1 again. Every iteration should still reject the failed low move thanks to the hash table, so it is almost like searching from ply 1 again, but with that move completely excluded. However, when I played with this, I ran into one problem...