- Sep 22, 2009 — [The Towers of Hanoi: recursive and iterative implementation in Scheme](/2009/09/22/the-towers-of-hanoi-recursive-and-iterative-implementation-in-scheme.html)

Legend has it that a group of Eastern monks are the keepers of three towers on which sit 64 golden rings. Originally all 64 rings were stacked on one tower with each ring smalle...

- Sep 22, 2009 — [N queens puzzle: a scheme and x86 assembly solution](/2009/09/22/n-queens-puzzle-a-scheme-and-x86-assembly-solution.html)

The eight queens puzzle is the problem of putting eight chess queens on an 8×8 chessboard such that none of them is able to capture any other using the standard chess queen’s mo...
