| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6868549 | Computational Geometry | 2018 | 4 Pages |
Abstract
Suppose the fighters perform a sequence of moves, M, that transform configuration A into configuration B. If we swap the states of all vertices in B that do not contain a fighter and let the fighters run backwards, we reach a configuration where each vertex burning in A is now free of fire. As a consequence, if M is an extinguishing strategy, so is its reverse, Mâ¾.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Rolf Klein,