The one-firefighter containment conjecture for the strong grid
Statement
The strong grid is the graph obtained from the square grid by joining vertices that are at king-move distance one, so each vertex is adjacent also to its diagonal neighbours. In the Pyro game, firefighters protect vertices while the fire spreads to unprotected neighbouring vertices. Strong-grid containment conjecture. In the Pyro game, one firefighter cannot contain a fire on the strong grid. The source states that two firefighters suffice, while whether one firefighter suffices remains unknown; it therefore conjectures that one firefighter is insufficient.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.