2016-12-05 22:15:40 +01:00
|
|
|
[[File:chess_queen.jpg|400px||right]]
|
|
|
|
|
|
|
|
|
|
[[File:N_queens_problem.png|400px||right]]
|
|
|
|
|
|
2015-02-20 00:35:01 -05:00
|
|
|
Solve the [[WP:Eight_queens_puzzle|eight queens puzzle]].
|
|
|
|
|
|
2013-04-10 23:57:08 -07:00
|
|
|
|
2016-12-05 22:15:40 +01:00
|
|
|
You can extend the problem to solve the puzzle with a board of size <big>'''N'''x'''N'''</big>.
|
|
|
|
|
|
|
|
|
|
For the number of solutions for small values of '''N''', see [http://oeis.org/A000170 oeis.org sequence A170].
|
|
|
|
|
|
|
|
|
|
|
2017-09-23 10:01:46 +02:00
|
|
|
;Related tasks:
|
|
|
|
|
* [[A* search algorithm]]
|
|
|
|
|
* [[Solve a Hidato puzzle]]
|
|
|
|
|
* [[Solve a Holy Knight's tour]]
|
|
|
|
|
* [[Knight's tour]]
|
2019-09-12 10:33:56 -07:00
|
|
|
* [[Peaceful chess queen armies]]
|
2017-09-23 10:01:46 +02:00
|
|
|
* [[Solve a Hopido puzzle]]
|
|
|
|
|
* [[Solve a Numbrix puzzle]]
|
|
|
|
|
* [[Solve the no connection puzzle]]
|
2016-12-05 22:15:40 +01:00
|
|
|
<br><br>
|
