Programming puzzles on Chess

Champak Roy December 07, 2021




  • 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.

Tags:

Post a Comment

Me
Me
WhatsApp Contact Me on WhatsApp
×

📩 Today’s Programming Tip

✅ Java Tip: Use Executors for thread pool management.
Example:
ExecutorService executor = Executors.newFixedThreadPool(3);
executor.execute(() -> System.out.println("Task executed"));

🔗 Learn More

💡 Tip of the Day