在n×n 格的棋盘上放置彼此不受攻击的车。按照国际象棋的规则，车可以攻击与之处 在同一行或同一列上的棋子。在棋盘上的若干个格中设置了堡垒，战车无法穿越堡垒攻击别 的战车。对于给定的设置了堡垒的n×n格棋盘，设法放置尽可能多彼此不受攻击的车。用概率算法实现的！-n n grid placed on the chessboard of each other against attack vehicles. According to the rules of chess, with cars can attack at the same firms listed on the same or a pawn. On the chessboard of several grid is set fortress and tank attacks can not be fortress through other vehicles. For a given set of a bastion of n n Lattice chessboard, trying to put as much as possible not to attack each other's cars. Using probabilistic algorithm!