This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;; This is the missionaries & cannibals problem solved in Scheme. | |
;; The code is not as elegant as it could have been | |
;; (lacking recursion, in the spirit of Scheme, in many places). | |
;; It is also not very generic. Also does no optimization and | |
;; will apply search paths back and forth. | |
;; It works however, and should be relatively readable. | |
;; "https://class.coursera.org/aiplan-001/forum/thread?thread_id=164" | |
(use srfi-1) |