Happy Thanksgiving! Please note that there are no classes November 25th-December 1st.

MIT PRIMES/Art of Problem Solving

CROWDMATH 2017: Graph Algorithms & Applications

a
p
Visibility Graphs J
A procedure for finding winning strategies in cop-v-killer
j B k k N
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rauss
2 posts
#1 • 2 Y
This topic is linked to Problem 8.
Y by Adventure10, Mango247
I've altered the procedure from Vertex-to-Vertex Pursuit in a Graph to model the cop-vs-killer game. I've attached a sketch of the definition and a python file modelling it for graphs represented as adjacency lists.
Attachments:
copvkiller.py (4kb)
copvkiller.pdf (87kb)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rauss
2 posts
#2 • 2 Y
Y by Adventure10, Mango247
Here are updates to the code and proof. Added docstrings and comments to program. Added a formal proof section to the paper.
Attachments:
copvkiller.pdf (117kb)
copvkiller.py (4kb)
Z K Y
N Quick Reply
G
H
=
Page Feed | J
Linked Item Topics
G
Topic
First Poster
Last Poster
H
A procedure for finding winning strategies in cop-v-killer
rauss   1
N Mar 9, 2018 by rauss
I've altered the procedure from Vertex-to-Vertex Pursuit in a Graph to model the cop-vs-killer game. I've attached a sketch of the definition and a python file modelling it for graphs represented as adjacency lists.

1 reply
rauss
Jan 16, 2018
rauss
Mar 9, 2018
J
H
More Progress
monkeymoney   2
N Jun 30, 2017 by JGeneson
Strategy:
Try to chase your opponent in to a corner, where you can then stand diagonally from your opponent, forcing your opponent to move in to a vertex adjacent to you, at which point you can kill your opponent. Since both the cop and the killer are using optimal strategy, they would not voluntarily step in front of the other.

monkeymoney
2 replies
monkeymoney
Jun 27, 2017
JGeneson
Jun 30, 2017
J
No more topics!
H
J
H
A procedure for finding winning strategies in cop-v-killer
rauss   1
N Mar 9, 2018 by rauss
I've altered the procedure from Vertex-to-Vertex Pursuit in a Graph to model the cop-vs-killer game. I've attached a sketch of the definition and a python file modelling it for graphs represented as adjacency lists.

1 reply
rauss
Jan 16, 2018
rauss
Mar 9, 2018
J