Introduction - If you have any usage issues, please Google them yourself
independent diamond chess Problem description : a chessboard, there are 44 pieces of diamonds, a position vacant chessboard initial state as follows : 111111111 111101111 111111111 which, 0 no place pawn, a place said. Provisions in law are as follows : a. as a pawn to be crossed an adjacent piece (bear adjacent) jumped to a vacant position, and eaten across the pawn (shift from the chessboard) If, after the chessboard go one step further state : 111111111 111111111 111110011 111111111 111111111 b. leaving only a game son on the chessboard, and in the middle position. Requirements : getting the correct procedures in law. Input : None output : each step of the chessboard mobile state, the format above.
Packet : 961369钻石棋问题.rar filelist
opp_实验_1_0312102_19_杨欧_0312102_张立飞_0312101_陈召鹤
opp_实验_1_0312102_19_杨欧_0312102_张立飞_0312101_陈召鹤\11.cpp
opp_实验_1_0312102_19_杨欧_0312102_张立飞_0312101_陈召鹤\c++.doc