Description Usage Arguments Details Examples
1 2 3 | hexagon_distance(steps)
find_longest_hexagon_distance(steps)
|
steps |
a sequence of hexagon directions |
Part One
Crossing the bridge, you've barely reached the other side of the stream when a program comes up to you, clearly in distress. "It's my child process," she says, "he's gotten lost in an infinite grid!"
Fortunately for her, you have plenty of experience with infinite grids.
Unfortunately for you, it's a hex grid.
The hexagons ("hexes") in this grid are aligned such that adjacent hexes can be found to the north, northeast, southeast, south, southwest, and northwest:
1 2 3 4 5 6 7 | \ n /
nw +--+ ne
/ \
-+ +-
\ /
sw +--+ se
/ s \
|
You have the path the child process took. Starting where he started, you need to determine the fewest number of steps required to reach him. (A "step" means to move from the hex you are in to any adjacent hex.)
For example:
ne,ne,ne
is 3
steps away.
ne,ne,sw,sw
is 0
steps away (back where you started).
ne,ne,s,s
is 2
steps away (se,se
).
se,sw,se,sw,sw
is 3
steps away (s,s,sw
).
Part Two
How many steps away is the furthest he ever got from his starting position?
1 2 | hexagon_distance(c("se", "sw", "se", "sw", "sw"))
find_longest_hexagon_distance(c("se", "sw", "se", "sw", "sw"))
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.