Search found 378 matches

by towforce
Sun Sep 06, 2020 8:37 pm
Forum: Computer Chess Club: General Topics
Topic: Chess experiment
Replies: 5
Views: 290

Re: Chess experiment

I've tried several experiments with weak players and assistants. The following seemed to produce the best learning experience. The weaker player has an assistant and the assistant has a computer. On each move, the weak player decides his move for himself but he is allowed to ask the assistant is th...
by towforce
Sun Sep 06, 2020 11:23 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14044

Re: Chess solved?

The proof in the original paper is that chess has key mathematical transformations to boolean game G3, and that boolean game G3 has already been proven to be exponentially more difficult to resolve as its size increases. The original paper says nothing whatsoever about proving that G3 is EXPTIME co...
by towforce
Sun Sep 06, 2020 8:51 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14044

Re: Chess solved?

The proof in the original paper is that chess has key mathematical transformations to boolean game G3, and that boolean game G3 has already been proven to be exponentially more difficult to resolve as its size increases. The original paper says nothing whatsoever about proving that G3 is EXPTIME com...
by towforce
Sun Sep 06, 2020 8:42 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14044

Re: Chess solved?

syzygy wrote:
Sat Sep 05, 2020 11:07 pm
Btw, your "shortest path problem" is computationally really easy to solve.

I know: I told you that the complexity is O(edges + vertices). I deliberately chose a simple problem so that we could discuss the issue, rather than the problem itself.
by towforce
Sat Sep 05, 2020 10:06 pm
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14044

Re: Chess solved?

If you've read this paper carefully and know a little bit about computational complexity, you'll already know about another paper that kills your goal (at least for NxN). May I humbly request that you quote one single sentence from the paper that goes from number of moves to checkmate to determinin...
by towforce
Sat Sep 05, 2020 11:15 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14044

Re: Chess solved?

If you've read this paper carefully and know a little bit about computational complexity, you'll already know about another paper that kills your goal (at least for NxN). May I humbly request that you quote one single sentence from the paper that goes from number of moves to checkmate to determinin...
by towforce
Sat Sep 05, 2020 10:54 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14044

Re: Chess solved?

Do you have experience in TCS or anything closely related? If I was writing a proof/conjecture that the computational complexity of proving a win in chess can increase exponentially in n on an n*n board then I would start it by clearly explaining the overall method - something like this: * I will s...
by towforce
Sat Sep 05, 2020 9:01 am
Forum: Computer Chess Club: General Topics
Topic: Chess solved?
Replies: 265
Views: 14044

Re: Chess solved?

There are chess positions in which there are a large number of moves to the checkmate, but for which a rule can be written to determine whether the position is winning or not. That disproves the (assumed, not stated in the report) idea that there is a linear relationship between the number of moves...
by towforce
Fri Sep 04, 2020 3:46 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

Well, ignoring the agnorance, the challenge for you a few days ago was to "solve" tic-tac-toe before claiming 8*8 chess was "solvable" by polynomial. Here's the list of all possible unique tic-tac-toe positions as described, just to help you along. We'll await your polynomial expression with intere...
by towforce
Fri Sep 04, 2020 3:21 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

A NN isn't a polynomial, but you should actually show a polynomial that "solves" tic-tac-toe if you don't want to keep being laughed at in this forum. All in good time. Actually, I don't mind people laughing at me, and I am impressed at how long it takes intelligent people to work this out about me...