Given a chessboard in which it is not known how the black and white boxes are arranged but it is sure that there will 32 black squares and 32 white squares. You have to find the least possible distance between any two squares of same colour.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
