Can You Solve the Million-Dollar, Unsolvable Chess Problem? – Atlas Obscura

The problem may not be intrinsically challenging by nature, but increasing the size of the board pushes it from complex to nigh impossible. Public Domain

Faced with seemingly unsolvable problems, historically, people get creative, whether a sword through the Gordian Knot or the threat of one through a disputed baby. But a seemingly simple chess problem will require a sharper solutionso sharp, in fact, that researchers at the University of St. Andrews in Scotland are offering a $1 million reward.

The riddle, known as the Queens Puzzle, was 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 growssay 100 queens on a 100-by-100 chessboard. When the numbers start getting really large, computer solutions are unable to solve it.

Any program that could do so will be far more powerful than anything we currently have, said Professor Ian Gent, a computer scientist at the university. If you could write a computer program that could solve the problem really fast, you could adapt it to solve many of the most important problems that affect us all daily. This program, he said, would be able to decrypt even the toughest online security, something that would take current software thousands of years to unravel, by scrolling through and then discarding an almost infinite number of solutions until one works. His colleague, Peter Nightingale, questioned whether this is even be possible. What our research has shown is thatfor all practical purposesit cant be done, he says. Hence the massive prize offer.

Although its hard to prove definitively, historians believe chess was invented in around the year 570, in what is now northeastern India. There is no shortage of famous chess puzzles, many of which remain unsolved to this day. A more recent development, however, has come in the writing of programs that create or solve problems too difficult or time-consuming for humans to do unassisted.

Some of these programs are so complicated that even their designers dont fully understand how they work. Chesthetica, a program written by the computer scientist Azlan Iqbal, generates hundreds of problems, using digital synaptic neural substrate (DSNS) technology. One might ask where does Chesthetica get its ideas? writes Iqbal in Chess News. I do not know. How or why should a computer be able to compose chess problems like these at all? Can computers autonomously do this sort of thing? These are also good questions and I believe the answer lies with the DSNS technology. Why it works, he explained, remained an open questionbut, somehow, it does. Maybe the large Queens puzzlesolving program will be similarly inscrutable.

View post:
Can You Solve the Million-Dollar, Unsolvable Chess Problem? – Atlas Obscura

Related Post

Comments are closed.