Hi all,
This wil create copy rights violation. Please try to respect the authors note..
On 4/18/11, KK wrote:
> Hey plzz mail me too..
>
> On Apr 14, 9:29 am, Rajeev Kumar wrote:
>> check this
>> link:https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=1B5...
>>
>> If you have any
Please cc me also. Tia.
On 4/16/11, rgap wrote:
> Send me links too, please
>
> On Apr 10, 3:14 am, rahul rai wrote:
>> None has been published . If you want i can give you a two links to
>> video courses , and some set of solved questions . Which will be good
>> for "compiler design help"
>>
>
Hi all, I guess the bishops problem has a generic solution. The
formula is 2n-2. Where n is the chess board size n * n . Regarding the
arrangement one can place n bishops in one side of the board and on
the opposite side you can place n-2 bishops starting from the position
n/2 to n-2 position, and
