This puzzle was published in *New Scientist* in June 2020^{1}. It is a practical example of a
problem in graph theory. This vignette explains how the puzzle can be
solved with `redecison`

.

Three friends agree to drive from A to B via the shortest road possible (driving down or right at all times). They are hungry, so also want to drive through a Big Burger restaurant, marked in red. They are arguing about how many shortest routes will pass through exactly one Big Burger. Xenia: “I reckon there are 10.” Yolanda: “I’d say more like 20.” Zara: “No you’re both wrong, I bet there are more than 50.” Who is right, or closest to right?

The grid has 25 nodes and 40 edges (20 horizontal and 20 vertical). These form a directed graph because it is allowed to drive down or right only. Seven of the edges are defined as “Big Burger” edges. Because it is not possible to find a path from any node which revisits that node, the graph is acyclic (a directed acyclic graph, DAG).

Although it possible to construct the graph by creating 25 node objects explicitly, it is more compact to create a list of vertices in a loop construct. Indices \(i = [1 .. 5]\) and \(j = [1 .. 5]\) are used to identify grid intersections in the vertical and horizontal directions respectively. Each node is labelled as \(N_{i,j}\) and the index of node \(N_{i,j}\) in the list is \(5(i-1)+j\).

Similarly, the 40 edges (arrows) are constructed more compactly in a list, with horizontal edges being labelled \(H_{i,j}\) (the horizontal edge joining node \(N_{i,j}\) to node \(N_{i,j+1}\)) and the vertical edges similarly as \(V_{i,j}\).

```
# create vertices
<- list()
V for (i in 1L : 5L) {
for (j in 1L : 5L) {
<- c(V, Node$new(paste0("N", i, j)))
V
}
}# create edges
<- list()
E for (i in 1L : 5L) {
for (j in 1L : 4L) {
<- Arrow$new(
a * (i - 1L) + j]], V[[5L * (i - 1L) + j + 1L]], paste0("H", i, j)
V[[5L
)<- c(E, a)
E
}
} for (i in 1L : 4L) {
for (j in 1L : 5L) {
<- Arrow$new(
a * (i - 1L) + j]], V[[5L * i + j]], paste0("V", i, j)
V[[5L
)<- c(E, a)
E
}
} # create graph
<- Digraph$new(V, E) G
```

Method `paths`

finds all possible paths between any two
nodes, where a *path* is defined as a sequence of distinct and
adjacent nodes. Because the restaurants are specific edges, each path is
converted to a *walk*, which is a path defined as sequence of
connected, non-repeating edges.

In this case, the number of restaurants traversed by each path is counted by comparing the label associated with each edge in each path with the labels of the edges which contain a restaurant.

Note that although we cannot guarantee that node A is saved
*within* the graph at index 1 and node B is saved at index 25, we
do know that A and B are saved at indices 1 and 25 in the local list
`V`

.

```
# get all paths from A to B
<- V[[1L]]
A <- V[[25L]]
B <- G$paths(A, B)
P # convert paths to walks
<- lapply(P, function(p) G$walk(p))
W # count and tabulate how many special edges each walk traverses
<- c("V11", "H22", "V25", "H33", "V32", "H44", "V43")
BB <- vapply(W, FUN.VALUE = 1L, FUN = function(w) {
nw <- vapply(w, FUN.VALUE = TRUE, FUN = function(e) e$label() %in% BB)
lv return(sum(lv))
})# tabulate
<- as.data.frame(table(nw)) ct
```

`rdecision`

The number of paths which pass through exactly one Big Burger is 23. In total there are 70 paths from A to B, with the number of restaurants \(n\), traversed by each path as follows:

n | frequency |
---|---|

0 | 6 |

1 | 23 |

2 | 27 |

3 | 13 |

4 | 1 |

Yolanda’s estimate is closest - there are 23 shortest routes from A to B that pass through exactly one Big Burger. One way to solve this kind of puzzle is to systematically work from A and keep track of how many ways there are of reaching each point. With this problem, you should keep a separate count of how many ways there are of reaching each point after (a) zero or (b) one Big Burger visits. For line segments that contain a Big Burger, (b) becomes equal to (a) then becomes equal to 0 with the old value for (b) effectively discarded.

1.

Bodycombe, D. Burger run. *New
Scientist* **246,** 54 (2020).