@@ -19,8 +19,8 @@ would be:
20Let's implement a factorial calculator in Hoon. To do so, we'll write a
20Let's implement a factorial calculator in Hoon. To do so, we'll write a
21recursive `gate` (Hoon's equivalent of a function) to perform the relevant
21recursive `gate` (Hoon's equivalent of a function) to perform the relevant
22−computation. Save the code below as `factorial.hoon` in your ship's `/gen`
22+computation. Save the code below as `factorial.hoon` in the `/gen` directory of
23−directory.
23+the `%base` desk on your ship.
@@ -185,11 +185,10 @@ skips the first match of a name.
185### Exercises
185### Exercises
1871. Write a recursive gate that produces the first _n_
1871. Write a recursive gate that produces the first _n_
188−[Fibonacci numbers](https://en.wikipedia.org/wiki/Fibonacci_number)
188+ [Fibonacci numbers](https://en.wikipedia.org/wiki/Fibonacci_number)
1902. Write a recursive gate that produces a list of moves to solve the
1902. Write a recursive gate that produces a list of moves to solve the
191−[Tower of Hanoi problem](https://en.wikipedia.org/wiki/Tower_of_Hanoi).
191+ [Tower of Hanoi problem](https://en.wikipedia.org/wiki/Tower_of_Hanoi).
192−Disks are stacked on a pole by decreasing order of size. Move all of the
192+ Disks are stacked on a pole by decreasing order of size. Move all of the
193−disks from one pole to another with a third pole as a spare, moving one
193+ disks from one pole to another with a third pole as a spare, moving one
194−disc at a time, without putting a larger disk on top of a smaller disk.
194+ disc at a time, without putting a larger disk on top of a smaller disk.