This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140450 The count of how many queens must be placed tentatively onto a board while seeking a first solution to the "N-Queens on an N x N chessboard" puzzle. 2

%I

%S 1,6,18,26,15,171,42,876,333,975,517,3066,1365,26495,20280,160712,

%T 91222,743229,48184,3992510,179592,38217905,584591,9878316,1216775,

%U 10339849,12263400,84175966,44434525,1692888135,408773285,2799725104,4618568460

%N The count of how many queens must be placed tentatively onto a board while seeking a first solution to the "N-Queens on an N x N chessboard" puzzle.

%C The term a(4) with the value 26 is the count for a board size of 4 squares by 4 squares. The highest term so far a(45) is the count for a board of 45 squares by 45 squares.

%C This whole sequence refers only to the number of queen pieces placed tentatively on a board in the hunt for the FIRST POSSIBLE solution for each board size. This sequence makes no reference to queen placements needed to hunt for subsequent solutions that are possible for board sizes above 3x3.

%D CSP Queens - Counting Queen-placements http://queens.cspea.co.uk/

%H Colin S. Pearson, <a href="/A140450/b140450.txt">Table of n, a(n) for n = 1..45</a> [Corrected Jul 31 2008]

%H Colin S. Pearson, <a href="http://queens.cspea.co.uk/">CSP Queens - Counting Queen-placements</a>

%H Martin S. Pearson, <a href="http://queens.lyndenlea.info/">Queens On A Chessboard</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Eight_queens_puzzle">Eight Queens puzzle</a>

%e Using a simple, mechanical and naive "one queen at a time" algorithm (in other words, a computer-friendly algorithm), in order to place 4 non-clashing queens on a simple board of 4 x 4 squares, we will need to place a tentative new queen 26 times before we discover the first combination that allows all queens to sit unchallenged. For a board size of 5 x 5 we will need to place tentative new queens just 15 times before we discover the first combination of 5 unchallenged queens. In this extended and corrected sequence, those figures "26" and "15" are the values of terms a(4) and a(5) above.

%o A step-by-step example of this algorithm applied to 5 Queens on a 5 X 5 board is displayed on the web site at http://queens.cspea.co.uk/. In addition, a free Microsoft Windows WIN32s-based program can be downloaded from the same website. The program generates and displays these terms for any board size up to 32 squares by 32 squares.

%Y Cf. A000170 = Number of ways of placing n nonattacking queens on n X n board; A002562 = Number of ways of placing n nonattacking queens on n X n board (symmetric solutions count only once); A141843 = Triangular array of lexicographically earliest solutions to the n queens problem.

%K nonn

%O 1,2

%A Colin S. Pearson and Martin S. Pearson, Jun 26 2008, Jun 30 2008, Jul 03 2008, Jul 31 2008, Aug 16 2008

%E Edited by Colin S Pearson to update the URL for Martin S Pearson's website _Colin S. Pearson_, Mar 25 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 19 03:45 EST 2018. Contains 318245 sequences. (Running on oeis4.)