# Chess, a solved game in the future?

**URL:** <https://boards.straightdope.com/t/chess-a-solved-game-in-the-future/429903>\
**Category:** Factual Questions\
**Created:** [December 13, 2007, 8:56pm UTC](https://boards.straightdope.com/t/chess-a-solved-game-in-the-future/429903 "2007-12-13T20:56:25Z")\
**Posts on this page:** 2\
**Page:** 7

<div class="post-metadata">

**Author:** ![yelimS](https://avatars.discourse-cdn.com/v4/letter/y/54ee81/32.png) [@yelimS](https://boards.straightdope.com/u/yelimS)\
**Post date:** [December 17, 2007, 6:19pm UTC](https://boards.straightdope.com/t/chess-a-solved-game-in-the-future/429903/121 "2007-12-17T18:19:35Z")

</div>

**FryLock** and **Indistinguishable** : agreed, and like I said, I’d originally changed my mind about posting, but only too late. Good some interesting points came out of it. I’ll think twice next time:)

---

<div class="post-metadata">

**Author:** ![Indistinguishable](https://avatars.discourse-cdn.com/v4/letter/i/90ced4/32.png) [@Indistinguishable](https://boards.straightdope.com/u/Indistinguishable)\
**Post date:** [December 17, 2007, 6:22pm UTC](https://boards.straightdope.com/t/chess-a-solved-game-in-the-future/429903/122 "2007-12-17T18:22:51Z")

</div>

Yeah. The big problem is collapsing the superpositions in such a way as to (with bounded probability of error) pick out the best move from among them, rather than just any old move from among them. (That’s the main roadblock for most applications of quantum computing; e.g., it’s why we still don’t know if quantum computers are any good at solving NP-complete problems)

ETA: Er, that in reply to **Chronos**. But you can read it too. 🙂

[Previous page](https://boards.straightdope.com/t/chess-a-solved-game-in-the-future/429903.md?page=6)