Description: 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!
- [travSrcCVar] - vehicle refueling will issue the restric
- [SSCMS10Build0501] - SSCMS website management system stops fl
- [bowuguan] - world-famous paintings from the museum m
- [lqx10004] - minimum weight machines based design of
- [che] - The issue of the chariot chariot chariot
- [Delphi] - Large amount of Delphi development data,
- [3] - Many cases, when the algorithm in the im
- [STM32-Primer-Manual] - Raisonance s stm32 development board man
- [queen] - Las Vegas (Las Vegas) algorithm to solve
- [fortress2v600] - fortress2 v600 code server
File list (Check if you may need any files):