> Concepts and strategies
This algorithm aims to find the cells on which the adversary will not have line of sight, even while moving.
Hide and seek is one of the first methods that will allow you to manage your movements more effectively.
If your leek hides behind an obstacle so as to be unreachable for the opponent, the latter will have no choice but to use a devious method, such as Spark which strikes through the obstacles, or the AoE.
The method that is generally used to find the cells where you will be hidden uses the Accessible cells algorithm.
So the first step is to get your cells accessible, so you know which cells you can move to, and therefore potentially hide in. But also to know those of your opponent (or your opponents), in order to know where your opponent can go, and thus find a cell where he cannot reach you, even while moving.
It is then necessary to determine the cells which are "safe" among the cells accessible to your leek. To do this, you must test each of these cells and check the lines of sight with the opponent's accessible cells. If there is no line of sight between a cell and those of the adversary, then this one will not be able to target this cell, even while moving.
Thus, the idea is to start from the hypothesis that a cell is "safe", and to try to prove the opposite. We then test each of the opponent's cells as long as there is no line of sight. As soon as a line of sight exists, it means that the adversary will be able to reach this cell. It is of course possible to refine and calculate a "danger" on the candidates for the hideout to choose the least bad, for example not to leave the opponent the possibility of an M-Laser line shot.
Green square: Your leek / Red square: Opponent / Blue squares: Opponent's accessible cells Green line: No line of sight / Red line: Line of sight
Impossible de charger les données du jeu.
Vérifiez votre connexion et réessayez.