This makes her the most powerful piece at your disposal by far. Unlike her lazy husband, the queen can move any amount of squares in any direction – horizontally, vertically, or diagonally. Next is the king’s faithful companion: the queen. You can allow any of your pieces or pawns to be captured if you so choose (though it’s usually not a good idea), but it is actually illegal as per the rules of chess to let your king be captured! How the Queen Moves You also cannot move your king on a square where one of the opponent’s pieces or pawns can take it. They can take the squares of your opponent’s pieces, however this is called “capturing.” To capture a piece, you simply replace it with your own and remove the opponent’s piece from the board. This is true for all of your pieces and pawns in fact: they cannot occupy the same square as another. In general, you can move your king anywhere on the board, except to squares occupied by another one of your pieces or pawns. It can move horizontally, vertically, or diagonally (see the diagram above). Please comment down below if you have a better insight in the above approach.The king, marked with a cross-bearing crown, can move in any direction one square. Read about a knight's tour from here to understand how the chessboard is assumed to be a graph and how come a knight can move to any different squareĬan you think of some other approach to solve this problem? Think dynamic programming approach!Ĭount of all possible ways to reach a target by a KnightĬan a knight visit all the squares of the board Where A and B are the dimensions of the board. queue for storing states of knight in boardįor (int i = 0 i = 1 & x = 1 & y <= B) Int minStepToReachTarget(int A, int B, int C, int D, int E, int F) Visit all the possible locations from the locationĪnd increase the number of moves accordingly in the Pop from the queue and store it in variable Now do the following until the queue is empty or the knight reaches the target location. Mark the visited array corresponding to the knight’s location as True. Which will store the number of moves required to reach there from the initial position.Ĭreate a queue and push the knight’s starting position in it. If the current location is not the target location, then we can pop it from the queue and will enqueue the possible legal moves from that location. If the reachable position is not already visited and is inside the board, we enqueue this state into a queue with a number of moves of 1 more than its parent state. So, starting from the initial position we will try to make all 8 legal moves. Now, we have considered it as a graph, we can use the The below image is showing how it will look if you consider the chessboard as a graph. Is a vertex and the edges can be one legal move of the knight. Let’s imagine the chessboard as a graph where each square of the chessboard The problem asked us to find the least number of moves to move the knight from position

Moves two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming the shape of an L). If you have played chess then you know that a The minimum number of moves required for this is 3. Input: A = 6, B = 6, C = 1, D = 1, E = 4, F = 5Įxplanation: The size of the chessboard is 6圆, the knight is initially at (1, 1) and the knight wants to reach position (4, 5). Int E and int F: denotes the target of the Knight Int C and int D: denotes the position of the Knight Int A and int B: denotes the size of the chessboard If the knight can not move from the source point to the destination point, then returnįollowing is the description of the parameters of the function “ The above figure describes the movements for a knight (8 possibilities).

Knight moves in chess