well its game of Number Theory
There are 3 possibilities in any number set - prime numbers, non-prime
numbers (that are not squares) squares.
In this puzzle the original state of a door will be reversed if it is
acted upon an odd number of times - otherwise the original state the
final state
Generalization algorithm for the 8 - queens classical chess problem
On Jan 4, 5:43 am, bittu shashank7andr...@gmail.com wrote:
There is a lock which is an N by N grid of switches. Each switch can
be in one of two states (on/off). The lock is unlocked if all the
switches are on. The lock is
ankur is right
this problem is similar to the problem of converting a matrix to zero matrix
On Tue, Jan 4, 2011 at 8:36 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote:
how are they similar ?
On Tue, Jan 4, 2011 at 8:31 PM, jennmeedo jennme...@gmail.com wrote:
Generalization algorithm for
