Yes, it's quite exciting when one discovers that concept for the first time. One imagines one is the first discoverer and needs to tell everyone else the fascinating news.Ovyron wrote: ↑Tue Nov 19, 2019 6:05 pmHeh, it's curious that you brought up the Tower of Babel in your other post, because I can use something similar to prove you wrong, let me introduce you to...chrisw wrote: ↑Tue Nov 19, 2019 5:14 pmPedantically, while white may play one move only, e4, he must have a move stored for all of blacks replies (20 moves), and after the White stored move, another move for all black replies. So now we are four ply deep or whatever and we need 500 moves stored. Keep multiplying by 30 or so every other ply, you’ll be in LaLa land shortly. No possible. Space not available.
Unfortunately, it again doesn't help your argument to shift it uselessly into yet another place where the same problems of space and time arise.
Shall we discuss Flat Earth Theory instead? One can generate way more challenging and interesting theories and arguments if one takes the Flat Earth side, just for fun. Chess solve theorising is a bit boring, really, there's just the time problem and the space problem, once past those, well, end of theories.
How about Antartica being a giant plug holding back the world's interior from falling out of the bottom of the earth?
The Library of Babel.
This guy has encoded everything that could be said ever. So on there there's a copy of our entire conversation.
Here's a link of a page that contains the text you typed in that I just quoted, and note this page already contained your text before you typed it.
The Library of Babel contains already the solution to chess and any other game you could come up with, a series of instruction of how to make a program that plays EGTB32 moves on chess positions without having to store them, and anything you can think of.
Let me demonstrate.
Since we don't have special symbols for FEN I'll make up my own chess notation. Pieces are denoted as wr wn wb wk wq wp for white and br bn bb bk bq bp for black. ee would be empty spaces. Moves will be denoted with common coordinates as starting square and ending square. We can afford to use full names for numbers instead of numbers. We don't need to specify the side to move, because we can just store what would be white's best move and black's best move if they were to move.
Suppose that from the opening position d4 (d two d four) is white's best move, and for the sake of completion, d5 (d seven d five) was black's best move (if black had to move first from the starting position). It'd look encoded like this:
Well, before I woke up this morning this page already contained this text.Code: Select all
br bn bb bq bk bb bn br bp bp bp bp bp bp bp bp ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee ee wp wp wp wp wp wp wp wp wr wn wb wq wk wb wn wr d two d four d seven d five
What about that position where Gusev played Qxe5 and the fastest time to find it has been 3 seconds? It'd look encoded like this:
This page shows the solution instantly. Turns out if black was to move Rxd6 would be best, who knew?
So the solution to any chess position is encoded already in the Library of Babel.
Unfortunately, all chess positions and all their playable moves are also encoded there, so you can't tell them apart, but if someone can come up with an algorithm that deleted all pages with chess positions encoded like this from the Library of Babel, except for those that have the best move from white and for black, then you'd have your EGTB32. How ironic is it that instead of having to store info about the best moves, a chess map would need us to delete all non-best moves?