Cops and Robbers graph problem reframed as non-deterministic planning challenge

Researchers have framed the "Cops and Robbers" problem in graph theory as a non-deterministic planning challenge. This approach utilizes advanced planners to determine if a given graph is "k-copwin," meaning k cops can guarantee capturing a robber within a finite number of moves. The model treats cop movements as non-deterministic to account for all possible strategies, while the robber's movements are considered deterministic. The study also incorporates several variations from existing graph theory literature. AI

IMPACT This research reframes a classic graph theory problem using AI planning techniques, potentially advancing AI's capabilities in strategic game simulation and theoretical problem-solving.

RANK_REASON The item is an academic paper detailing a novel approach to a theoretical problem in graph theory. [lever_c_demoted from research: ic=1 ai=0.7]

Read on arXiv cs.AI →

• alphaXiv
• CatalyzeX Code Finder for Papers
• Cops and Robbers
• CORE Recommender
• DagsHub
• Gotit.pub
• graph theory
• Hugging Face
• Influence Flower
• k-copwin
• non-deterministic planning
• ScienceCast

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →