From 9aedbb911e1596f30229469a53e56cf5c1056c97 Mon Sep 17 00:00:00 2001
From: Peter Ward <peteraward@gmail.com>
Date: Thu, 2 Aug 2012 23:45:14 +1000
Subject: more sections

---
 docs/closest_apple.tex | 13 +++++++++++++
 1 file changed, 13 insertions(+)
 create mode 100644 docs/closest_apple.tex

(limited to 'docs/closest_apple.tex')

diff --git a/docs/closest_apple.tex b/docs/closest_apple.tex
new file mode 100644
index 0000000..36b7382
--- /dev/null
+++ b/docs/closest_apple.tex
@@ -0,0 +1,13 @@
+\section{Closest apple}
+
+One interesting bot we can write is one which always moves towards the closest
+apple. Both the idea and the coding are a little tricky, but see if you can
+handle it. In order to find the closest apple, we actually want to know
+the \emph{shortest path} to the apple, and when we know that, the first step in
+that path is the direction we need to move in.
+
+To find the shortest path, we need to use an algorithm called
+\emph{breadth first search} (BFS).
+% TODO: description of the algorithm
+
+\pythonfile{closest_apple.py}
-- 
cgit v1.2.3

