-
In a chess game, you are given 8 queens (color doesn't matter)and you have to place them on the board such that no queen kills any other (or is under direct attack). solve the puzzle by placing the 8 queens according to the condition.0
-
Administrator • Jul 12, 2012
This is a classic computer science '8 Queens Problem'.
A solution requires that no two queens share the same row, column, or diagonal. There are in all 92 solutions to this problem. But if the solutions that differ only by rotations and reflections of the board are counted as one, the puzzle has only 12 unique (or fundamental) solutions.Are you sure? This action cannot be undone. -
Member • Jul 13, 2012
I dont know about 12 solutions, but we found only 3 solution working on chess board for around 5 days 😀Are you sure? This action cannot be undone. -
Member • Jul 13, 2012
<a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank" rel="nofollow noopener noreferrer">Eight Queens Puzzle</a>Are you sure? This action cannot be undone. -
Member • Sep 22, 2012
This was discussed here with some depth.
#-Link-Snipped-#Are you sure? This action cannot be undone. -
Member • Sep 22, 2012
can u plz give me some tips on GATEAre you sure? This action cannot be undone. -
Member • Sep 23, 2012
check out a section here specially for gateShivani.bhupalcan u plz give me some tips on GATEAre you sure? This action cannot be undone.