Quiz On Chessboard Problem (original) (raw)

The "Eight Queens Puzzle" involves placing 8 queens on an 8x8 chessboard such that no two queens threaten each other. How many solutions are there for this problem?

If a knight piece is placed on a chessboard, how many legal moves can it make in a single turn?

Which of the following methods can be used to solve n-queen’s problem?

What is the N-Queens problem?

• Placing N queens on an N x N chessboard so that no two queens threaten each other.
• Placing N kings on an N x N chessboard so that they can capture each other.
• Placing N queens on an N x N chessboard with no constraints.
• Placing N pawns on an N x N chessboard so that they can reach the other side.

What is the Knight's Tour problem?

• A puzzle involving a knight in chess capturing other pieces.
• A puzzle involving a knight moving to every square on a chessboard exactly once.
• A puzzle involving placing knights on a chessboard without conflicts.
• A puzzle involving the longest path a knight can take on a chessboard.

Which type of graph problem is the Knight's Tour problem an example of?

• Traveling Salesman problem
• Hamiltonian cycle problem

What is the output of the code below if the input is qX = 4, qY = 5, oX = 6, oY = 7 :

C++ `

bool canQueenAttack(int qR, int qC, int oR, int oC) {     if (qR == oR)         return true;     if (qC == oC)         return true;     if (abs(qR - oR) == abs(qC - oC))         return true;

    return false; }

`

Given a square chessboard of N*N size, the position of the knight and the position of a target are given as (1, 3) and (5, 0) respectively. Find out the minimum steps a knight will take to reach the target position.

What is the total number of squares (including all sizes) on a standard 8x8 chessboard?

How will Queen move in the chess-board?

There are 10 questions to complete.

Take a part in the ongoing discussion