Search found 378 matches

by noobpwnftw
Tue Oct 22, 2019 2:08 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Move repetitions in tree search + transpositions
Replies: 13
Views: 2430

Re: Move repetitions in tree search + transpositions

But what if the shortest path doesn't want to expand it because the shortest path included an opposition mistake which gives us a much better option to focus on? But in the main line where this position shows up later this is the main move which we want to expand a lot? Well that is contradicting: ...
by noobpwnftw
Tue Oct 22, 2019 12:20 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Move repetitions in tree search + transpositions
Replies: 13
Views: 2430

Re: Move repetitions in tree search + transpositions

Very simple: 1. Only the path of globally shortest occurrence of a node gets the right to explore its child. 2. On other occasions treat it as a terminal node and adjust the score locally if the path indicates a repetition. Your search is breadth first, if you get to a node with a longer path, then ...
by noobpwnftw
Mon Oct 21, 2019 7:00 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

Then we are on the same page, nothing is perfect, but we can make it good enough. Provided this data, I also want to seek for alternative methods that are more efficient in improving this overall confidence level, while one can always go for higher depth/more MultiPV but that is exponentially expens...
by noobpwnftw
Mon Oct 21, 2019 5:54 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

in cc game play which uly tends to rely upon always. This is precisely the difference, I understand that sometimes more depth is required to find the winning moves, but it is not practical to do that for every position. So that is why the statistics, if we can raise the overall confidence level of ...
by noobpwnftw
Mon Oct 21, 2019 5:47 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

I replied to this statement of Uly. He hasn't stated he is making billion database positions with it either. He just stated his thought of taking depth 22 is optimal for human interactive analysis which seemed to match thought of yours and he has stated here in other threads too. If I get it will l...
by noobpwnftw
Mon Oct 21, 2019 4:40 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

Also my comment was in related to analyze positions of a corr game not to create a database of opening positions. Read what I wrote above in point 1 too. Of course, then why does any method of personal satisfaction has anything to do with how the database is calculated, I don't understand. No, nobo...
by noobpwnftw
Mon Oct 21, 2019 4:27 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

Master Om wrote:
Mon Oct 21, 2019 12:04 pm
Now how can u say its 70% right ? Is it an average for most positions or just an assumptions on observations of small data/positions ?
It seems that I'm the one providing data(in billions of unique positions) and you are the one making assumptions out of nowhere, go figure.
by noobpwnftw
Sun Oct 20, 2019 11:35 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

Therefore depth 22 is as dumb as it sounds. Quality very much depends on time and the time given in human interaction to the position. I assume that you can spend 100 years of your life time doing nothing else but "human interactions", and you have a relatively fast computer that can do depth 60 se...
by noobpwnftw
Wed Oct 16, 2019 9:05 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

How can u confirm this. Am curious to know. AFAIK even numbers have a blind spot . Roughly, at this depth it can hit "best" move with 70% probability, then among top 5 moves I have a statistically sound chance to be correct. Then this process is done recursively so generally it wouldn't miss import...
by noobpwnftw
Wed Oct 16, 2019 12:36 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 114
Views: 22187

Re: Database snapshot

A full database snapshot which contains about 5.6 billion unique positions as of 2019-10-16 is available at:
ftp://ftp.chessdb.cn/pub/chessdb/data-s ... 191016.tar