At 1000 qubits, the new processor considers 2^1000 possibilities simultaneously, a search space which dwarfs the 2^512 possibilities available to the 512-qubit D-Wave Two. ‪”In fact, the new search space contains far more possibilities than there are ‪particles in the observable universe.”
I was wondering if some of them could be bent to target chess.
So far, I was sure I would never see chess solved in my lifetime. With quantum computers gaining traction, I'm not so sure anymore.
At 1000 qubits, the new processor considers 2^1000 possibilities simultaneously, a search space which dwarfs the 2^512 possibilities available to the 512-qubit D-Wave Two. ‪”In fact, the new search space contains far more possibilities than there are ‪particles in the observable universe.”
I was wondering if some of them could be bent to target chess.
So far, I was sure I would never see chess solved in my lifetime. With quantum computers gaining traction, I'm not so sure anymore.
Two thirds voted never?! Is this the nineteenth or twenty-first century?
Two thirds voted never?! Is this the nineteenth or twenty-first century?
Don't worry. Come back in the twenty-two century, and you will see the same (if not worse) prediction
Seriously, quantum computing would be good for some specific problems (breaking public criptography, e.g.) but never seemed to fit general computing problems.
At 1000 qubits, the new processor considers 2^1000 possibilities simultaneously, a search space which dwarfs the 2^512 possibilities available to the 512-qubit D-Wave Two. ‪”In fact, the new search space contains far more possibilities than there are ‪particles in the observable universe.”
I was wondering if some of them could be bent to target chess.
So far, I was sure I would never see chess solved in my lifetime. With quantum computers gaining traction, I'm not so sure anymore.
Two thirds voted never?! Is this the nineteenth or twenty-first century?
Before quantum computing will have any impact on chess programming it will be solved by other means so the answer to the poll is 'never'.
At 1000 qubits, the new processor considers 2^1000 possibilities simultaneously, a search space which dwarfs the 2^512 possibilities available to the 512-qubit D-Wave Two. ‪”In fact, the new search space contains far more possibilities than there are ‪particles in the observable universe.”
I was wondering if some of them could be bent to target chess.
So far, I was sure I would never see chess solved in my lifetime. With quantum computers gaining traction, I'm not so sure anymore.
Two thirds voted never?! Is this the nineteenth or twenty-first century?
Before quantum computing will have any impact on chess programming it will be solved by other means so the answer to the poll is 'never'.
I'm not so sure it will ever be solved by any means. To solve it, ALL paths have to be searched to an endpoint conclusion of some sort. That is an absolutely impossible number of nodes thanks to the rules of the game (50 move rule is one issue). With the longest possible game something like 5500 moves, alpha/beta would choke on sort(38^5500) nodes. I don't even know how one would think about storing such a thing while searching it.
At 1000 qubits, the new processor considers 2^1000 possibilities simultaneously, a search space which dwarfs the 2^512 possibilities available to the 512-qubit D-Wave Two. ‪”In fact, the new search space contains far more possibilities than there are ‪particles in the observable universe.”
I was wondering if some of them could be bent to target chess.
So far, I was sure I would never see chess solved in my lifetime. With quantum computers gaining traction, I'm not so sure anymore.
Two thirds voted never?! Is this the nineteenth or twenty-first century?
Before quantum computing will have any impact on chess programming it will be solved by other means so the answer to the poll is 'never'.
I'm not so sure it will ever be solved by any means. To solve it, ALL paths have to be searched to an endpoint conclusion of some sort. That is an absolutely impossible number of nodes thanks to the rules of the game (50 move rule is one issue). With the longest possible game something like 5500 moves, alpha/beta would choke on sort(38^5500) nodes. I don't even know how one would think about storing such a thing while searching it.
No machine present has the potential and programming may have to start from scratch when a quantum computer with the potential is created.
I think a machine with the potential may be created well before 2050.
Terry McCracken wrote:No machine present has the potential and programming may have to start from scratch when a quantum computer with the potential is created.
I think a machine with the potential may be created well before 2050.
So far as I know, no quantum algorithm that would even help solve chess has been proposed. I doubt there is one. (Grover's algorithm looks like it would only help if a poor data structure was chosen.) Solving chess by conventional means would be very hard. It might be possible, but I can't believe anyone would ever bother.
Are we talking about solving chess theoretically (all the moves, all the lines) or practically? I don't need to know, for example, if 1. f3 holds, or if it's a black win, because I wouldn't play it anyway.
