This would be a good problem to solve. Its been a long time since i tried something like this.
The N Queen Problem is a generalized form of the 8 queen problem. In the 8 Queen problem, we have to place 8 queens on a chess board so that none of the queens is in check from any other queen(The queen should not be in the same row, column or diagonal). The N Queen problem would involve generalizing this to a n X n board with n queens.
Tuesday, May 20, 2008
Blog Archive
-
▼
2008
(26)
-
▼
May
(10)
- new java puzzlers (As presented in Javapolis --2007)
- How to derail your experts and ruin their performance
- Living out of the box
- The Dreyfus model
- The bane of java exceptional handling
- Iterating over Map's
- N Queen Problem
- Identifying Patterns and creating Higher Order Fun...
- Tail Recursion
- Scala vs Java : Implementing quicksort -- not opti...
-
▼
May
(10)