Search found 152 matches

by konsolas
Wed May 22, 2019 7:29 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Possible "real" hash collision
Replies: 27
Views: 685

Re: Possible "real" hash collision

I suppose you could try turning off hash cutoffs and seeing if you get the same result
by konsolas
Fri May 17, 2019 7:15 pm
Forum: Computer Chess Club: Tournaments and Matches
Topic: Swiss Tournament Ed.VIII. Group C.
Replies: 11
Views: 312

Re: Swiss Tournament Ed.VIII. Group C.

Hi Sergio,

Thanks for organising this. Could Topple be updated to 0.6.0? https://github.com/konsolas/ToppleChess ... tag/v0.6.0

Also, I'm from the UK and not the United States.

Thanks.
by konsolas
Wed May 15, 2019 9:09 pm
Forum: Computer Chess Club: General Topics
Topic: Topple 0.5.0
Replies: 6
Views: 741

Re: Topple 0.5.0

Wolfgang wrote:
Wed May 15, 2019 8:40 pm
Hi,

thanks for the new version!
Can you tell which of these many versions runs fine on AMD-CPUs like AMD-FX 8350?

Thanks ;)
The bdver4 compile should be optimised for older AMD CPUs.
by konsolas
Wed May 15, 2019 5:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Moving instantly based on the transposition table.
Replies: 7
Views: 436

Re: Moving instantly based on the transposition table.

This is something that is supposed to never happen, right? The depth you need in the root is the largest depth of the entire search, so only positions that have been searched at the root before should satisfy the requirement (but then you are already repeating positions, and mindlessly sticking to ...
by konsolas
Wed May 15, 2019 3:00 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Moving instantly based on the transposition table.
Replies: 7
Views: 436

Re: Moving instantly based on the transposition table.

Maybe this is specific to certain time controls: at a repeating time control like 40/4, engines rarely get under time pressure that this change would help to avoid.
by konsolas
Tue May 14, 2019 8:09 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Moving instantly based on the transposition table.
Replies: 7
Views: 436

Moving instantly based on the transposition table.

So in my last release of Topple, I added an interesting feature called "move from hash", where Topple probes the transposition table at the root position of a search, and if there is an entry with an exact bound, returns that as the bestmove instantly without any further searching, subject to some c...
by konsolas
Tue May 14, 2019 2:10 pm
Forum: Computer Chess Club: General Topics
Topic: Topple 0.5.0
Replies: 6
Views: 741

Re: Topple 0.5.0

Update on the above: Despite my belief in YBWC, it appears to simply not be as strong as Lazy SMP. On CCRL 40/4, Topple 0.5.0 (YBWC with PV splitting) is only 16 elo stronger given 4 threads to work with. So I've just written the most basic possible implementation of Lazy SMP (no skipping depths, no...
by konsolas
Sun May 12, 2019 4:23 pm
Forum: Computer Chess Club: General Topics
Topic: Komodo 13 released
Replies: 85
Views: 8199

Re: Komodo 13 released

~snip~ The scores reported by an MCTS engine like Komodo MCTS already reflect the possiblility of the opponent going wrong in plausible ways. Maybe it doesn't do it the same way you would, but at least to a significant degree it does what you want. That's really interesting. If this is possible wit...
by konsolas
Sun May 05, 2019 1:50 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Time reduction adding a/b to mini/max?
Replies: 9
Views: 449

Re: Time reduction adding a/b to mini/max?

With a mean branching factor of 30, minimax should take about 30^6 = 729 million nodes to search to depth 6. alpha-beta search with random ordering should take around ((30 - 1 + sqrt(30^2+14*30+1)/4)^6) = 305 million nodes. The expected time taken for alpha-beta given your minimax time of 30 seconds...