@all: Yah it's 100% true that for 32 white and 32 black we have min
distance at 0.
But question will become difficult when the number of white
and blacks are less than 32.
-Nagendra
On Tue, Sep 1, 2009 at 9:30 PM, Ramaswamy R<ramaswam...@gmail.com> wrote:
> If the white and the black squares are not arranged as in a chess board then
> we can be sure that there are at least two whites and two blacks which are
> adjacent by the sides.
> If not they will be adjacent diagonally. So the distance really depends on
> how it is defined for squares adjacent by a side and by a vertex
> (diagonally).
> Only two possibilities!
> On Tue, Sep 1, 2009 at 8:37 AM, yash <yashpal.j...@gmail.com> wrote:
>>
>> Given a chessboard in which u dont know how the black and white boxes
>> are arranged but this is sure that there will 32 black squares and 32
>> white squares.You have to find the least possible disatnce between any
>> two sqaures of same colour ...
>>
>>
>
>
>
> --
> Yesterday is History.
> Tomorrow is a Mystery.
> Today is a Gift! That is why it is called the Present :).
>
> http://sites.google.com/site/ramaswamyr
>
> >
>
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@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
-~----------~----~----~----~------~----~------~--~---
