Problem I. 180. (February 2008)
I. 180. Place 8 rooks on a chessboard such that none of them attacks any other. Half of the rooks should be put on white squares. Your program should give all possibilities. Squares of the chessboard are encoded as usual. Two arrangements are considered different if there is at least one square containing a rook on the first board but not on the second. Possible arrangements should be written into a text file in an arbitrary order. (The name of this file is given as a command line argument to your program.)
The description of a particular arrangement should consist of 10 lines: the first line contains the number of this arrangement, then 8 lines containing 8 ``X'' letters (as rooks) and 56 ``.'' characters (as empty squares) (see the Figure), finally an empty line.
The source code of your program (i180.pas, i180.cpp, ...) and a short documentation (i180.txt, i180.pdf, ...) should be submitted, containing the main ideas of your solution and the name of the developer environment to run the program.
Deadline expired on March 17, 2008.
Sorry, the solution is available only in Hungarian. Google translation
A feladat szépen megoldható pl. visszalépéses kereséssel. Mintaként Szabó Gábor 11. osztályos budapesti diák munkáját i180.cpp, valamint Földes Imre szintén 11. osztályos szolnoki versenyző munkáját i180.pas adjuk közre.
10 students sent a solution. 10 points: Földes Imre, Szabó 313 Gábor, Véges Márton. 9 points: Adrián Patrik, Molnár Gábor, Pap 987 Dávid. 4 points: 2 students. 3 points: 1 student. 1 point: 1 student.