- Category:
- CSharp
- Tags:
-
[Text]
- File Size:
- 782byte
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
- whatgaohui
Description: Algorithm processes: 1, data initialization. 2, from n to start out the first n-place Queen s (because it would be able to meet each vertical column of a Queen s request), first test the current position (n, m) is equal to 0 (not occupied): If yes, before let the first n of Queen s, and announced that the occupation (remember to put out oblique row out together Oh), followed by recursive If not, test the next location (n, m+ 1), but if n <= 8, m = 8, they found that at this time have been unable to display, it should be retroactive. 3, when n> 8, they all print out the results. Advantages: one by one testing standard answer, there will not be falling through the openings.
To Search:
- [cifa] - Compiler Construction Principles, the re
- [fibona] - fibona number of program design, using A
File list (Check if you may need any files):
Download