Problem 44347. Ned's queens

Created by HH

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A tribute to Cody's five-year anniversary should also celebrate the people behind Cody, and in this particular case, our illustrious Quizmaster, Ned Gulley.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The N-Queens problem (N stands for Ned, of course) is a well known computing challenge. If you are unfamiliar with this problem, refer to</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/113-n-queens-checker\"><w:r><w:t>Problem 113</w:t></w:r></w:hyperlink><w:r><w:t>, incidentally written by... You guessed it.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This problem is the real deal. Given a positive integer, n, representing the number of queens and the size of the board, return the number of possible solutions, s, and a list of the solutions, q.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>q shall be an array with s rows and n columns, such that each row represents one solution. The column indeces of q shall represent the column indeces of the positions of the queens in the respective solution, while the values of the array elements shall represent the row indeces of the positions of the queens in the respective solution. q does not have to be sorted.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Note: All symmetries/rotations count as individual solutions.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ Input: n = 4\n\n Output: s = 2, q = [2 4 1 3;3 1 4 2]]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

A tribute to Cody's five-year anniversary should also celebrate the people behind Cody, and in this particular case, our illustrious Quizmaster, Ned Gulley.The N-Queens problem (N stands for Ned, of course) is a well known computing challenge. If you are unfamiliar with this problem, refer to <a href = "https://www.mathworks.com/matlabcentral/cody/problems/113-n-queens-checker">Problem 113</a>, incidentally written by... You guessed it.This problem is the real deal. Given a positive integer, n, representing the number of queens and the size of the board, return the number of possible solutions, s, and a list of the solutions, q.q shall be an array with s rows and n columns, such that each row represents one solution. The column indeces of q shall represent the column indeces of the positions of the queens in the respective solution, while the values of the array elements shall represent the row indeces of the positions of the queens in the respective solution. q does not have to be sorted.Note: All symmetries/rotations count as individual solutions.Example:<pre> Input: n = 4</pre><pre> Output: s = 2, q = [2 4 1 3;3 1 4 2]</pre>

A tribute to Cody's five-year anniversary should also celebrate the people behind Cody, and in this particular case, our illustrious Quizmaster, Ned Gulley.

The N-Queens problem (N stands for Ned, of course) is a well known computing challenge. If you are unfamiliar with this problem, refer to <https://www.mathworks.com/matlabcentral/cody/problems/113-n-queens-checker Problem 113>, incidentally written by... You guessed it.

This problem is the real deal. Given a positive integer, n, representing the number of queens and the size of the board, return the number of possible solutions, s, and a list of the solutions, q.

q shall be an array with s rows and n columns, such that each row represents one solution. The column indeces of q shall represent the column indeces of the positions of the queens in the respective solution, while the values of the array elements shall represent the row indeces of the positions of the queens in the respective solution. q does not have to be sorted.

Note: All symmetries/rotations count as individual solutions.

Example:

Input: n = 4

Output: s = 2, q = [2 4 1 3;3 1 4 2]

Solve

Solution Stats

182 Solutions
74 Solvers

Last Solution submitted on Sep 26, 2023

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Peter Cook on 17 Nov 2017

This was a fun problem, but I think lookup table solutions are possible given the way the way the test suite is configured. Maybe you could add a string parser to see if the test suite correct solutions are included in the answer code?

Solution Comments

Show comments

Problem Recent Solvers74

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!