9/11/2017 | 76

Atlas Obscura explains why this seemingly simple question is so difficult to solve.

The riddle is based on what is known as the Queens Puzzle, first devised in 1850. Eight queens must be placed on a standard chessboard so that no two pieces can take one another. According to a release from the university, “This means putting one queen each row, so that no two queens are in the same column, and no two queens in the same diagonal.” Solutions are not hard to imagine, but the problem becomes more complex when the chessboard grows—say 100 queens on a 100-by-100 chessboard.

New research from computer science professors Ian P. Gent, Christopher Jefferson, and Peter Nightingale refers to a still more challenging variant in which the board is even larger, but some queens have already been placed. In an interview with the Clay Mathematics Institute, Gent said this problem, technically known as the “n-Queens Completion Problem,” falls into a class of high-level math puzzles known as “NP-Complete.” Any algorithm that could solve it, Gent said, could therefore be used indirectly to solve others in the class—and be a contender for the Millennium Prize.

Check out the official release from St. Andrew’s here.

View Source

{ "id": "GupMZrGo5C47VoNCekpErbTRrDfmaYDfuIVZMXGzBfQ=_15e6f8b9fc9:5dbce56:56b346f", "keywords": [ "math", "chess" ], "originId": "https://blog.adafruit.com/?p=318339", "fingerprint": "f65f7748", "content": { "content": "<div><p><img src=\"https://cdn-blog.adafruit.com/uploads/2017/09/image.jpg\" class=\"img-fluid\" /></p>\n<p><a>Atlas Obscura</a> explains why this seemingly simple question is so difficult to solve.</p>\n<blockquote><p>The riddle is based on what is known as the Queens Puzzle, first devised in 1850. Eight queens must be placed on a standard chessboard so that no two pieces can take one another. According to a release from the university, “This means putting one queen each row, so that no two queens are in the same column, and no two queens in the same diagonal.” Solutions are not hard to imagine, but the problem becomes more complex when the chessboard grows—say 100 queens on a 100-by-100 chessboard.</p>\n<p>New research from computer science professors Ian P. Gent, Christopher Jefferson, and Peter Nightingale refers to a still more challenging variant in which the board is even larger, but some queens have already been placed. In an interview with the Clay Mathematics Institute, Gent said this problem, technically known as the “n-Queens Completion Problem,” falls into a class of high-level math puzzles known as “NP-Complete.” Any algorithm that could solve it, Gent said, could therefore be used indirectly to solve others in the class—and be a contender for the Millennium Prize.</p></blockquote>\n<p>Check out the <a href=\"https://phys.org/news/2017-09-simple-chess-puzzle-key-1m.html#jCp\">official release from St. Andrew’s here</a>.</p>\n<div></div><div></div><div></div></div>", "direction": "ltr", "unsanitized": "<html><head></head><body><div><p><img border=\"0\" src=\"https://cdn-blog.adafruit.com/uploads/2017/09/image.jpg\" alt=\"Image\" width=\"800\" title=\"image.jpg\" height=\"547\" class=\"img-fluid\"></p>\n<p><a href=\"http://www.atlasobscura.com/articles/queens-puzzle-chess-problem-solution-software\">Atlas Obscura</a> explains why this seemingly simple question is so difficult to solve.</p>\n<blockquote><p>The riddle is based on what is known as the Queens Puzzle, first devised in 1850. Eight queens must be placed on a standard chessboard so that no two pieces can take one another. According to a release from the university, “This means putting one queen each row, so that no two queens are in the same column, and no two queens in the same diagonal.” Solutions are not hard to imagine, but the problem becomes more complex when the chessboard grows—say 100 queens on a 100-by-100 chessboard.</p>\n<p>New research from computer science professors Ian P. Gent, Christopher Jefferson, and Peter Nightingale refers to a still more challenging variant in which the board is even larger, but some queens have already been placed. In an interview with the Clay Mathematics Institute, Gent said this problem, technically known as the “n-Queens Completion Problem,” falls into a class of high-level math puzzles known as “NP-Complete.” Any algorithm that could solve it, Gent said, could therefore be used indirectly to solve others in the class—and be a contender for the Millennium Prize.</p></blockquote>\n<p>Check out the <a href=\"https://phys.org/news/2017-09-simple-chess-puzzle-key-1m.html#jCp\">official release from St. Andrew’s here</a>.</p>\n<div></div><div></div><div></div></div></body></html>" }, "title": "Can You Solve the Million-Dollar, Unsolvable Chess Problem?", "published": 1505109607000, "crawled": 1505109974985, "alternate": [ { "href": "https://blog.adafruit.com/2017/09/11/can-you-solve-the-million-dollar-unsolvable-chess-problem/", "type": "text/html" } ], "author": "Kelly", "origin": { "streamId": "feed/http://www.adafruit.com/blog/feed/", "title": "Adafruit Industries – Makers, hackers, artists, designers and engineers!", "htmlUrl": "https://blog.adafruit.com" }, "summary": { "content": "Atlas Obscura explains why this seemingly simple question is so difficult to solve. The riddle is based on what is known as the Queens Puzzle, first devised in 1850. Eight queens must be placed on a standard chessboard so that no two pieces can take one another. According to a release from the university, “This […]", "direction": "ltr" }, "visual": { "processor": "feedly-nikon-v3.1", "url": "https://cdn-blog.adafruit.com/uploads/2017/09/image.jpg", "width": 800, "height": 547, "contentType": "image/jpeg" }, "canonicalUrl": "https://blog.adafruit.com/2017/09/11/can-you-solve-the-million-dollar-unsolvable-chess-problem/", "unread": false, "categories": [ { "id": "user/447f76f6-44df-414e-a9af-794a73847bdb/category/Making", "label": "Making" } ], "tags": [ { "id": "user/447f76f6-44df-414e-a9af-794a73847bdb/tag/global.saved", "label": "Saved For Later" }, { "id": "user/447f76f6-44df-414e-a9af-794a73847bdb/tag/Awesome", "label": "Awesome" }, { "id": "user/447f76f6-44df-414e-a9af-794a73847bdb/tag/global.read", "label": "" } ], "actionTimestamp": 1505250275219, "engagement": 76 }