Algorithmic Problem Solving

References

[Bac08]	Roland Backhouse. The capacity-C torch problem. In Philippe Audebaud and Christine Paulin-Mohring (eds), Mathematics of Program Construction, 9th International Conference, MPC2008, Marseille, France, Lecture Notes in Computer Science 5133, pp. 57–78. Springer, 2008.
[BCaF10]	Roland Backhouse, Wei Chen, and João Ferreira. The algorithmics of solitaire-like games. In Claude Bolduc, Jules Desharnais, and Béchir Ktari (eds), Proceedings of 10th International Conference on Mathematics of Program Construction, Lecture Notes in Computer Science 6120, pp. 1–18. Springer, 2010.
[BCG82]	Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy. Winning Ways, vols I and II. Academic Press, 1982.
[BF01]	Roland Backhouse and Maarten Fokkinga. The associativity of equivalence and the Towers of Hanoi problem. Information Processing Letters, 77: 71–76, 2001.
[BL80]	P. Buneman and L. Levy. The Towers of Hanoi problem. Information Processing Letters, 10: 243–244, 1980.
[Dij76]	Edsger W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
[Dij90]	Edsger W. Dijkstra. EWD1083: The balance and the coins. http://www.cs.utexas.edu/users/EWD/ewd10xx/EWD1083.PDF, September 1990.
[Dij92]	Edsger W. Dijkstra. EWD1135: The knight’s tour. http://www.cs.utexas.edu/users/EWD/ewd11xx/EWD1131.PDF, September 1992.
[Dij97]	Edsger W. Dijkstra. EWD1260: The marked coins and the scale. http://www.cs.utexas.edu/users/EWD/ewd12xx/EWD1260.PDF, March 1997.
[DS90]	Edsger W. Dijkstra ...