Search found 2191 matches

by cdani
Mon Mar 22, 2021 6:52 am
Forum: Computer Chess Club: General Topics
Topic: Booot 6.5 release
Replies: 12
Views: 2313

Re: Booot 6.5 release

Congratulations!!
Is'nt there a Pascal -> C capable translator? Maybe will be easier for you to go for a NN.
by cdani
Thu Mar 18, 2021 9:24 pm
Forum: Computer Chess Club: General Topics
Topic: Searching for draw
Replies: 8
Views: 819

Re: Searching for draw

It seems that it is not exactly take it when possible Solved! Just download it again. If you don't ask me by private message I will not send you a version with nnue enabled much stronger :D Someone has used id? It works as expected? I tried and seems so. If at least two or three ppl are interested,...
by cdani
Sat Mar 13, 2021 12:15 pm
Forum: Computer Chess Club: General Topics
Topic: correspondence chess in the age of NNUE
Replies: 132
Views: 25818

Re: correspondence chess in the age of NNUE

Rebel wrote:
Sat Mar 13, 2021 11:53 am
My question is, what are the popular openings of correspondence players?
I saw everything. Most strong players do whatever is complicated enough to try that the game lasts enough to prove your rival.
by cdani
Fri Mar 12, 2021 10:15 pm
Forum: Computer Chess Club: General Topics
Topic: Searching for draw
Replies: 8
Views: 819

Re: Searching for draw

Uri Blass wrote:
Fri Mar 12, 2021 8:15 pm
It seems that it is not exactly take it when possible
Solved!
Just download it again.
If you don't ask me by private message I will not send you a version with nnue enabled much stronger :D
by cdani
Fri Mar 12, 2021 7:41 pm
Forum: Computer Chess Club: General Topics
Topic: correspondence chess in the age of NNUE
Replies: 132
Views: 25818

Re: correspondence chess in the age of NNUE

... The key is that as long as the chosen opening positions are near the edge of the win/draw line, this won't be the case even with a million to one speedup from current hardware. I hope those positions can be found/provoked by future engines because they understand chess much better than actual o...
by cdani
Thu Mar 11, 2021 9:42 pm
Forum: Computer Chess Club: General Topics
Topic: Searching for draw
Replies: 8
Views: 819

Re: Searching for draw

I have done a version of Andscacs that evaluates repetition of position as 5000, so it takes it when possible:

https://1drv.ms/u/s!Aj8wlSmr_Hq3ispbyGn ... g?e=Rdzam9
by cdani
Wed Mar 10, 2021 10:13 pm
Forum: Computer Chess Club: General Topics
Topic: Searching for draw
Replies: 8
Views: 819

Searching for draw

I'v seen a few times someone asking for an engine that searches for draw. How do you think such engine should work? I understand that the feed position will be bad and the engine should try to save it. But in fact this is what the engines try when they are in a bad position. So what is the differenc...
by cdani
Tue Mar 09, 2021 7:01 pm
Forum: Computer Chess Club: General Topics
Topic: correspondence chess in the age of NNUE
Replies: 132
Views: 25818

Re: correspondence chess in the age of NNUE

... The key is that as long as the chosen opening positions are near the edge of the win/draw line, this won't be the case even with a million to one speedup from current hardware. I hope those positions can be found/provoked by future engines because they understand chess much better than actual o...
by cdani
Tue Mar 02, 2021 6:54 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Reaching high search depths
Replies: 10
Views: 1209

Re: Reaching high search depths

I have experimented with making LMR more aggressive in my engine today and yesterday, but it loses around 300 elo (tc: 0/5s+0.1s for 300 games). The only conditions for the LMR is that depth > 2 and moves searched > 1 (4 if I'm in a PV node)... The strongest your engine is, the more you can reduce....
by cdani
Sun Feb 21, 2021 7:54 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Root search
Replies: 11
Views: 3550

Re: Root search

In Andscacs I also reduce differently root moves. For example I take into account the number of nodes searched and I do a mix with other stuff to decide how much to reduce. I also order the root moves differently initially, first the hash move and then by static evaluation. And I do a few other thin...