25 lines
766 B
TeX
Executable File
25 lines
766 B
TeX
Executable File
\documentclass[../main.tex]{subfiles}
|
|
|
|
\begin{document}
|
|
|
|
\problem{How Does the Prisoner Escape?}
|
|
|
|
This dungeon has $49$ cells. In $7$ cells ($A$ to $G$ in the diagram) there is a locked door (black bar). The keys are in cells $a$ to $g$ respectively. The other doors open only from one side, as shown. \\
|
|
|
|
\medskip
|
|
|
|
How does the prisoner in cell $O$ escape? He can pass through any door any number of times and need not unlock the doors in any special order. His aim is to get the key from cell $g$ and use it to escape through cell $G$
|
|
|
|
\begin{figure}[h]
|
|
\centering
|
|
\includegraphics[width=8cm]{121}
|
|
\end{figure}
|
|
\vfill
|
|
|
|
Here's an extra copy of the dungeon:
|
|
\begin{figure}[h]
|
|
\centering
|
|
\includegraphics[width=8cm]{121}
|
|
\end{figure}
|
|
|
|
\end{document} |