Programming puzzles on Chess

• Given 2 x,y positions check if a bishop can move from x1, y1 to x2, y2
• Given a x,y position find all the places that the bishop can move to. Also try for 2 moves.
• Given a x,y position find all the places that a knight can move to. Also try for 2 moves.
• Given a x,y position find all the places that a queen can move to.
• Solve the 8 queens problem
• Solve the Knights problem
• Find the positions that a pawn can move to given a x,y position.
•