The time is now - Spring classes are filling up!

MIT PRIMES/Art of Problem Solving

CROWDMATH 2017: Graph Algorithms & Applications

G
Topic
First Poster
Last Poster
Retracts and the Cop and Killer game
goodbear   7
N Dec 26, 2017 by JGeneson
I have some additional results on the cop and killer game, with the intent of being able to characterize outcomes using retracts of the original graphs. Because I used some features of LaTeX not available on AoPS (such as defining some of the symbols I use), I'm just attaching the PDF here for now; if I have time later I'll convert to inline BBCode and update this post.
7 replies
goodbear
Nov 24, 2017
JGeneson
Dec 26, 2017
cop vs robber in a maze
JGeneson   16
N Nov 21, 2017 by JGeneson
Let $R$ be a connected region in the plane. Suppose that the cop is a segment of length $x$ and the robber is a segment of length $y$.

The cop starts inside $R$ (so we assume that a segment of length $x$ fits somewhere inside $R$), as does the robber. Based on $R$, $x$, $y$, and the initial positions, does the cop catch the robber if both use optimal play?

A good place to start might be regions $R$ where all sides are parallel to the coordinate axes.

How does the result change if the cop and robber are circles or squares instead of segments?

What if the game is played inside connected regions in space?
16 replies
JGeneson
Aug 22, 2017
JGeneson
Nov 21, 2017
No more topics!
a