It looks like you're using an Ad Blocker.
Please white-list or disable AboveTopSecret.com in your ad-blocking tool.
Thank you.
Some features of ATS will be disabled while you continue to use an ad-blocker.
A chess problem could help scientists finally unravel whether quantum theory can explain human consciousness.
Oxford professor Sir Roger Penrose created the puzzle to prove the human mind can never be matched by a computer because it exhibits quantum effects.
This means the brain doesn't follow the rules for the classical properties of matter like a computer.
Instead, it follows rules for a new concept of matter altogether that leaves cracks for consciousness and intuition to appear.
Now, Sir Roger has set up a new institute to test his theory, and has invited everyday puzzle enthusiasts to pit their wits against the problem as part of his research.
originally posted by: PokeyJoe
I wonder if this same theory holds true with the newest chess AI trained with deep learning? I believe that opens up a whole new ballgame. See DeepMind mastering Go recently.
originally posted by: o0oTOPCATo0o
Pretty easy to get a stalemate here.
Stay on white all his pieces are trapped besides the bishops on black
originally posted by: SuicideKing33
Interesting. White can just move his king willy-nilly on the light squares where the bishops cannot reach. Meanwhile Blacks huge material advantage is locked up in prison.
Hard to believe today's computers would self destruct and open the position for Black by capturing a rook.
originally posted by: PokeyJoe
I wonder if this same theory holds true with the newest chess AI trained with deep learning? I believe that opens up a whole new ballgame. See DeepMind mastering Go recently.
Your Android phone (or iPhone, if that's how you roll) is an impressive machine, with computing speeds and storage capacities thousands of times those of desktop PCs from only years ago. If Moore's Law holds up, your smart watch may outshine today's phones the way today's phones eclipse old PCs.
But no matter how powerful these machines become, they may never develop true intelligence if we continue to rely on conventional computing technology. According to the authors of a paper published in the journal Physical Review X last July, however, adding a dash of quantum mechanics could do the trick.
Quantum walks, on the other hand, describe a walker who doesn't exist at one spot at a time, but instead is distributed over many locations with varying probability of being at any one of them. Instead of taking a random step to the left or right for example, the quantum walker has taken both steps. There is some probability that you will find the walker in one place or the other, but until you make a measurement the walker exists in both.
That's not to say you'd need to make a full-blown quantum computer to build a truly intelligent machine - only part of an otherwise classical computer would need to be supplemented with a bit of quantum circuitry. That's good because progress toward developing a stand-alone quantum computer has been about as slow as the progress toward artificial intelligence. Combining artificial intelligence systems with quantum circuitry could be the recipe we need to build the HAL 9000s and R. Daneel Olivaws of the future.
Oxford professor Sir Roger Penrose created the puzzle to prove the human mind can never be matched by a computer because it exhibits quantum effects.
originally posted by: xenon129
I put this in stockfish 7 which is one of the top engines. It's interesting because it gives black a huge advantage (-26.2) but the cpu for white will never move off of the white squares with the king. It's weird because the cpu can recognize draws. In this situation the cpu will never take with a pawn because the 3 pawn move possibilities ends up in a force checkmate for black in 9,7, or 6 moves. So the cpu will make infinite amount of accurate moves to force a draw but doesn't ever recognize a draw.
originally posted by: TarzanBeta
1. c7 Bxc7
Easy indeed.
I have always said human intuition trumps the computer. We blunder when we try to calculate too much.
ETA foolish already. Let me go back through that.
I let the black king out.
Right. Just push the King to c8, then push the pawn to c7. When the computer finally takes, it's stalemate. It takes a number of moves, but as long as white never takes, it is an inevitable draw.
Silly me for pushing that pawn first.
Yeah, when the King finally is able to get to a8, when the bishops have cleared the diagonal, then the pawn goes to c7. Black then has no choice but to take, or else 1. c8=Q#.
When black takes, the white king can't move.
It Is imperative for the computer to make sure a bishop is on d8 in order to force the draw.
originally posted by: o0oTOPCATo0o
originally posted by: TarzanBeta
1. c7 Bxc7
Easy indeed.
I have always said human intuition trumps the computer. We blunder when we try to calculate too much.
ETA foolish already. Let me go back through that.
I let the black king out.
Right. Just push the King to c8, then push the pawn to c7. When the computer finally takes, it's stalemate. It takes a number of moves, but as long as white never takes, it is an inevitable draw.
Silly me for pushing that pawn first.
Yeah, when the King finally is able to get to a8, when the bishops have cleared the diagonal, then the pawn goes to c7. Black then has no choice but to take, or else 1. c8=Q#.
When black takes, the white king can't move.
It Is imperative for the computer to make sure a bishop is on d8 in order to force the draw.
But after the bishop takes the pawn, you would still be able to take a piece with one of your pawns.
Quantum Chess
Posted on February 15, 2016 by Chris Cantwell
Two years ago, as a graduate student in Physics at USC, I began work on a game whose mechanics were based on quantum mechanics. When I had a playable version ready, my graduate adviser, Todd Brun, put me in contact with IQIM’s Spiros Michalakis, who had already worked with Google to design qCraft, a mod introducing quantum mechanics into Minecraft. Spiros must have seen potential in my clunky prototype and our initial meeting turned into weekly brainstorming lunches at Caltech’s Chandler cafeteria. More than a year later, the game had evolved into Quantum Chess and we began talking about including a video showing some gameplay at an upcoming Caltech event celebrating Feynman’s quantum legacy. The next few months were a whirlwind. Somehow this video turned into a Quantum Chess battle for the future of humanity, between Stephen Hawking and Paul Rudd. And it was being narrated by Keanu Reeves! The video, called Anyone Can Quantum, and directed by Alex Winter, premiered at Caltech’s One Entangled Evening on January 26, 2016 and has since gone viral. If you haven’t watched it, now would be a good time to do so (if you are at work, be prepared to laugh quietly).
All pawns move the same as they would in standard chess, but all other pieces get a choice of two movement types, standard or quantum. Standard moves act exactly as they would in standard chess. However, quantum moves, create superposition's. Let’s look at an example of a quantum move for the white queen.
So, let’s talk about moving the queen, again. You may be wondering, “What happens if I want to move a piece that is in a superposition?” The queen exists in two spaces. You choose which of those two positions you would like to move from, and you can perform the same standard or quantum moves from that space. Let’s look at trying to perform a standard move, instead of a quantum move, on the queen that now exists in a superposition. The result would be as follows:
Dice chess can refer to a number of chess variants in which dice are used to alter gameplay; specifically that the moves available to each player are determined by rolling a pair of ordinary six-sided dice. There are many different variations of this form of dice chess.[1] One of them is described here.