Description: University of American computer science and technology
In the 15*15 grid, in 300 steps, within 120 seconds, see who has walked through the lattice, each machine has its own color, red or blue.
1. The car can shoot the spot to attack the opponent, shooting the opponent, the opponent will walk your color, lasting 20 steps.
2. The number of available spots is 30.
If you hit the wall, the game ends and you lose.
If you hit another car, stop the game and draw a multi-grid car win.
5. The game layout includes a stone grid, which is a wall
The specks of the fire cannot pass the stone
7. Every time you control the algorithm, it will accept the 5*5 squares around it. The car is in the middle, pointing in the direction. This is called short range browsing.
8. Your algorithm can have a long view of limited times. The range is 15* 15. (see below) you can get a long scan that you can ask for when you walk. Limit 30.
9. The game layout includes a dance box. If the fog does not cover the stone, then any car will draw the grid like any other lattice. However, a long view cannot show what is under the fog. But short views can show what's under the fog. Fog can drift, expand, or shorten in operation.
The car will determine its next step in each grid.
Interface class for PaintBotsControl. Java
For PaintBotsControl algorithm control class
To Search:
- [trans] - Operation of the image, open a color ima
- [matlabquzao] - The level of plot to use the method to a
- [segmenter] - A simple and effective Chinese word segm
File list (Check if you may need any files):
Download