You are not logged in. Please login at to post your questions!


Bishop Problem

If bishop is currently on the cell (r,c) of an empty chessboard. What will be the algorithm to move the bishop to the cell (r1,c1) using as few moves as possible. example: Question: The bishop can go from (4,6) to (7,3) in a single move. Answer: No. of moves will be: 1

asked 09 Dec '14, 16:31

sidharth_jain's gravatar image

accept rate: 0%

another similar chess problem:


answered 09 Dec '14, 19:32

gvaibhav21's gravatar image

accept rate: 25%

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 09 Dec '14, 16:31

question was seen: 791 times

last updated: 09 Dec '14, 19:32