Problem: 
Puzzle 1: Place 5 chess
queens on the chess board in so that every one of the 64 squares is
attacked by at least one of them. Since this includes the squares that the
queens are standing each queen must be attacking at least one other queen.
Puzzle 2: Puzzle 2 is the same as puzzle one except that the five
locations that contain queens should not be attacked. In other words, make sure
that every square is either being attacked by a queen or has a queen standing
on it but not both.


Solvers: 
 Jonathan (solved: 11:29pm 2162005)
 the greathoj (solved: 12:17am 2172005)
 John Tippabattuni (solved: 8:22am 2172005)
 none (solved: 10:54am 2172005) *
 Brian Glass (solved: 10:58am 2172005)
 Sriram (solved: 11:57am 2172005)
 slaydragon (solved: 11:59am 2172005)
 The Killer Llama (solved: 1:48pm 2172005)
 Erin (solved: 3:39pm 2172005)
 eeyalpud ydna (solved: 6:30pm 2172005)
 Senthil (solved: 10:18am 2182005)
 tom von kercey (solved: 8:17pm 2212005)
 Mike (solved: 12:33pm 2222005)
* = Solved only puzzle 2.


Solution: 
There are many correct solutions for each puzzle.


Main Page 