## Maximum bishops that can be placed on N*N chessboard

Given an integer n, the task is to print the maximum number of bishops that can be placed on a n x n chessboard so… Read More »

- Minimum steps to reach target by a Knight | Set 2
- Check if the given chessboard is valid or not
- Place K-knights such that they do not attack each other
- Minimum number of moves required to reach the destination by the king in a chess board
- Maximum bishops that can be placed on N*N chessboard
- Number of blocks in a chessboard a knight can move to in exactly k moves

Given an integer n, the task is to print the maximum number of bishops that can be placed on a n x n chessboard so… Read More »

Given four integers sourceX, sourceY, destinationX and destinationY which represent the source and destination coordinates on a chessboard. The task is to find the minimum… Read More »

Given integers i, j, k and n where (i, j) is the initial position of the Knight on a n * n chessboard, the task… Read More »

Given integers M, N and K, the task is to place K knights on an M*N chessboard such that they don’t attack each other. The… Read More »

Given a NXN chessboard. The task is to check if the given chessboard is valid or not. A chess board is considered valid if every… Read More »

Given a square chessboard of N x N size, the position of Knight and position of a target is given, the task is to find… Read More »

Given n, of a n x n chessboard, find the proper placement of queens on chessboard. Previous Approach : N Queen Recommended: Please try your… Read More »

Given a chess board of dimension m * n. Find number of possible moves where knight can be moved on a chessboard from given position.… Read More »

Consider a N X N chessboard with a Queen and K obstacles. The Queen cannot pass through obstacles. Given the position (x, y) of Queen,… Read More »

Problem : A knight is placed on the first block of an empty board and, moving according to the rules of chess, must visit each… Read More »

Given a square chessboard of N x N size, the position of Knight and position of a target is given. We need to find out… Read More »

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example,… Read More »

Given an NxN chessboard and a Knight at position (x,y). The Knight has to take exactly K steps, where at each step it chooses any… Read More »

The N queens puzzle is the problem of placing N chess queens on an N×N chessboard so that no two queens threaten each other. Thus, a solution requires that no… Read More »

We have discussed Knight’s tour and Rat in a Maze problems in Set 1 and Set 2 respectively. Let us discuss N Queen as another… Read More »