## Search found 378 matches

Fri Sep 04, 2020 2:47 pm
Forum: Computer Chess Club: General Topics
Topic: Linear evaluations with tic-tac-toe, some data
Replies: 7
Views: 338

### Re: Linear evaluations with tic-tac-toe, some data

Following the discussions on linear evaluations to 'solve' chess, and the unanswered challenge to provide some data for even the simple game of noughts and crosses, or tic-tac-toe as it is known, I did some quick experiments (Python, Keras) 1. Build the entire game tree, evaluating each terminal no...
Fri Sep 04, 2020 2:42 pm
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14064

### Re: Chess solved?

... the report therefore does not prove that which it claims to prove. Yes, it does (or at least no one has found any error in it). It is not claiming that there are zero easy positions. It is claiming that there exist hard positions. So if people want to find quick rules that apply to a strict sub...
Fri Sep 04, 2020 12:52 pm
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14064

### Re: Chess solved?

The proof does not have to talk about the non-existence of quick rules. Thinking it does is getting things backwards. It needs to prove the claimed result by any valid mathematical argument. If it does that, then the result proves the non-existence of quick rules. Not the reverse. So where's the pa...
Fri Sep 04, 2020 11:30 am
Forum: Computer Chess Club: General Topics
Topic: playing like a human should do it
Replies: 20
Views: 931

### Re: playing like a human should do it

Impressive! Looks nothing like a computer game to me!
Fri Sep 04, 2020 9:11 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14064

### Re: Chess solved?

That is not evidence. That is simply an assertion that contradicts the whole result of the paper. Just stating something contradictory to the abstract is not bringing evidence. (I hope this is clear to you. If it isn't, please tell us what's not clear.) The paper "proves" (I'm not convinced, but fo...
Thu Sep 03, 2020 4:16 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Looking for intrinsic "least significant bit" on Visual Studio
Replies: 34
Views: 946

### Re: Looking for intrinsic "least significant bit" on Visual Studio

chrisw wrote:
Thu Sep 03, 2020 3:56 pm
Btw, are you compiling SF NNUE in VS, I got stuck on compile errors demanding c++17 support?

Some projects require the C++ redistributable. If so, you can get it here.
Thu Sep 03, 2020 2:46 pm
Forum: Computer Chess Club: General Topics
Topic: Next-Gen GPUs for LC0
Replies: 23
Views: 1445

### Re: Next-Gen GPUs for LC0

Give in to the dark side, and suck power like a titanic inductor, screaming through a magnetar's magnetic field. Sure, you will eat one potato a day, but you will have beautiful chess. Which is more important? If it's not too inconvenient, it would be interesting for you to watch two computers, one...
Thu Sep 03, 2020 1:54 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Looking for intrinsic "least significant bit" on Visual Studio
Replies: 34
Views: 946

### Re: Looking for intrinsic "least significant bit" on Visual Studio

It looks like a language issue rather than visual studio. In C derived languages, it's normally something like:

b [0] = 0 != (v & 1);
b [1] = 0 != (v & 2);
b [2] = 0 != (v & 4);
b [3] = 0 != (v & 8);

etc.

Basically 0 != (v & Math.Pow(2, bitnumber))
Thu Sep 03, 2020 11:55 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14064

### Re: Chess solved?

I have not been following this discussion properly but have you posted about why you believe we will very likely solve chess in the future with these new emergent patterns, if that is your claim? I cannot give you a straight answer, so I'll answer in parts and try to keep those parts understandable...
Thu Sep 03, 2020 8:54 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14064

### Re: Chess solved?

From what's written in the paper, it's not going to be easy to disprove any of the above 3 points. However, I read the whole paper as carefully as I could, and, unless I missed it, there's actually no proof in there that in complex positions, it's impossible for rules to exist which can tell you qu...