Can finite-state deterministic graphical games of perfect information, given explicitly as graphs, be solved in linear time by a comparison-based algorithm?
Statement
Can finite-state deterministic graphical games of perfect information, given explicitly as graphs, be solved in linear time by a comparison-based algorithm?
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.