1 5 2 6 - - - - - -
3 7 4 8 On Thu, Nov 11, 2010 at 3:16 PM, Abhilasha jain <[email protected]>wrote: > solution is > 5 1 6 2 > _ _ _ _ > > 7 3 8 4 > > > On Thu, Nov 11, 2010 at 1:26 PM, Amod <[email protected]> wrote: > >> We have a rectangle >> It is divided in eight parts by three vertical and one horizontal line >> > > >> so that there are 8 chambers. >> Now we have numbers from 1-8 to be filled in these chambers. >> Rule : No two consecutive numbers must be present either side to side >> or diagonal >> Invalid situation example >> Given 5 at position 2 then 4 cannot occur at any of the give position. >> 4 5 4 >> _ _ _ _ >> >> 4 4 4 >> _ _ _ _ >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Rohit Singhal B.Tech. Part-IV, Department Of Electronics Engineering, Centre of Advanced Studies, Institute Of Technology, BHU -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
