Search found 2096 matches

by cdani
Sat Feb 09, 2019 6:25 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Killers and forward pruning test searches
Replies: 16
Views: 2581

Re: Killers and forward pruning test searches

Hmm, Topple loses about 10 Elo if I implement this. It uses less nodes for the same depth on some positions, but more nodes on other positions. Strange. RubiChess also loses Elo when clearing killers of ply+1. Clearing at ply+2 is more promising but tests still running. ./Andreas Clearing at ply+2 ...
by cdani
Sun Feb 03, 2019 10:30 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: chess programming - predictions for the next 5 years
Replies: 15
Views: 2692

Re: chess programming - predictions for the next 5 years

My attemps are mostly improving Andscacs positionally, without forgetting other more standard approaches. Not much success for the moment...
by cdani
Sun Feb 03, 2019 10:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Killers and forward pruning test searches
Replies: 16
Views: 2581

Re: Killers and forward pruning test searches

Killers are very local. Some engines even enforce that (presumably because it was shown to gain Elo) by explicitly clearing the killer slots for the daughter level when they enter a node. This means you could never inherit a killer from any node other than a sibbling in the same search. Then the si...
by cdani
Mon Jan 28, 2019 10:06 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Killers and forward pruning test searches
Replies: 16
Views: 2581

Re: Killers and forward pruning test searches

hgm wrote:
Mon Jan 28, 2019 9:17 am
Killers are very local. Some engines even enforce that (presumably because it was shown to gain Elo) by explicitly clearing the killer slots for the daughter level when they enter a node.
Yes, some elo win.
by cdani
Mon Jan 21, 2019 7:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Playing transposition table moves in the Quiescence search
Replies: 14
Views: 2161

Re: Playing transposition table moves in the Quiescence search

The tt move, if any, should be tried first. As long as it does not lose elo, this seems to be theoretically correct. I never found a non-capture move in the tt table on the horizon. This is because a non-capture tt best move would have a greater depth stored and the hash probe should prune. Hash pr...
by cdani
Mon Jan 21, 2019 7:34 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Playing transposition table moves in the Quiescence search
Replies: 14
Views: 2161

Re: Playing transposition table moves in the Quiescence search

Would not quiet moves explode and make the position noisy? Daniel Jose Queralto (Andscacs) suggested a complete QS cutoff at depth of -6. Current tests on my engine demonstrate an elo loss with any QS depth cutoff. The exchange combinations are necessary. There are SEE methods that try to reduce th...
by cdani
Sun Jan 20, 2019 8:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On-line engine blitz tourney January
Replies: 19
Views: 2492

Re: On-line engine blitz tourney January

Modern Times wrote:
Sat Jan 19, 2019 10:40 pm
Daniel should be pleased with that, I am ! :) That was one very tough tournament.
:D Nice!
by cdani
Mon Dec 24, 2018 6:56 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On-line engine blitz tourney December
Replies: 18
Views: 1852

Re: On-line engine blitz tourney December

Yes it is me. :) In the past I've run Trace, Crafty, Cheng, Nirvanachess, Gaviota, Stockfish and maybe some others I've forgotten. Graham suggested this time that I run AndScacs. There have been occasions when the author himself has participated, in which case I choose a different engine. There are...