The complexity of Scotland Yard

MaRDI QIDQ3574472zbMATH OpenFDO

Authors Merlijn Sevenster

Publication date 9 July 2010

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• On the computational complexity of a game of cops and robbers
• The complexity of pursuit on a graph
• On the power of imperfect information
• The complexity of two-player games of incomplete information
• scientific article; zbMATH DE number 2170338

Cited in

(1)

• The complexes of Peter Sellers

Describes a project that uses

Uses Software

• PlayGame

This page was built for publication: The complexity of Scotland Yard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574472)