2) N-Queens. A Queen on a chessboard can attack any piece in the same column, row or diagonal. The N-Queens problem is to place n queens on a n x n chessboard such that no two queens threaten each other. a) Implement a one-dimensional integer array of Queen positions for an 8x8 board where indices represent rows and the values represent columns. For example, this "safe" solution would be {3,6,2,7,1,4,0,5} b) Request values for the array from the console. c) Implement an output to display the board (see output example). d) Implement a queensAreSafe function that: 1) Returns false if multiple queens share a column. Note that by design they are in separate rows (make sure you understand why). 2) Returns false if multiple queens share a diagonal. 3) Returns true if all queens are safe. e) Program should display if the Queens are safe or not safe. Example output (input is bold and italicized) : Enter 8 column values: 1 4 2 3 5 7 6 O Queens are not safe!

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

I'm stuck on this question and I don't know how I should be approaching this. What should I do?

2) N-Queens.
A Queen on a chessboard can attack any piece in the same column, row or
diagonal. The N-Queens problem is to place n queens on a n x n chessboard
such that no two queens threaten each other.
a) Implement a one-dimensional integer array of Queen positions for an 8x8
board where indices represent rows and the values represent columns.
For example, this "safe" solution would be {3,6,2,7,1,4,0,5}
b) Request values for the array from the console.
c) Implement an output to display the board (see output example).
d) Implement a queensAreSafe function that:
1) Returns false if multiple queens share a column. Note that by
design they are in separate rows
(make sure you understand why).
2) Returns false if multiple queens share a diagonal.
3) Returns true if all queens are safe.
e) Program should display if the Queens are safe or not safe.
Example output (input is bold and italicized) :
Enter 8 column values: 1 4 2 3 5 7 6 O
Queens are not safe!
Transcribed Image Text:2) N-Queens. A Queen on a chessboard can attack any piece in the same column, row or diagonal. The N-Queens problem is to place n queens on a n x n chessboard such that no two queens threaten each other. a) Implement a one-dimensional integer array of Queen positions for an 8x8 board where indices represent rows and the values represent columns. For example, this "safe" solution would be {3,6,2,7,1,4,0,5} b) Request values for the array from the console. c) Implement an output to display the board (see output example). d) Implement a queensAreSafe function that: 1) Returns false if multiple queens share a column. Note that by design they are in separate rows (make sure you understand why). 2) Returns false if multiple queens share a diagonal. 3) Returns true if all queens are safe. e) Program should display if the Queens are safe or not safe. Example output (input is bold and italicized) : Enter 8 column values: 1 4 2 3 5 7 6 O Queens are not safe!
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Research
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education