# Influence Maps and New Versions of Risk

# Ashlock and Lee

` risk, graph theory, influence maps `

@article{ashlock:gapd-2015,
author={Daniel Ashlock and Colin Lee},
title={Graph Theory in Game and Puzzle Design},
journal={Game and Puzzle Design Journal},
year=2015,
volume=1,
number=1,
pages={38--43}
}

Influence maps quantify how much influence one position has on another

- Analogous computation of gaps being pumped into a network, collecting a bit at each node and moving into the branches

Want to find where to add a teleport link between continents to break common defensive strategies

Have to take care in comparing results because adding edges, nodes changes graph labeling

Doesn't the end result just come out to be adding a node between the two nodes with greatest distance between them, the diameter of the graph?

Maybe more interesting analytical tool if cutting edges rather than adding?