X-Git-Url: http://git.annexia.org/?a=blobdiff_plain;f=ocaml%2Fsudoku.ml;fp=ocaml%2Fsudoku.ml;h=65dd3b2513cbbebfd4621c797623fdf8f03ded24;hb=60a6a789a1e4dbac5373bc44a9aa005b618e3716;hp=0000000000000000000000000000000000000000;hpb=ef0022342d93f1917da6ee6dcdcd019b1dbb42ee;p=fedora-mingw.git

diff --git a/ocaml/sudoku.ml b/ocaml/sudoku.ml
new file mode 100644
index 0000000..65dd3b2
--- /dev/null
+++ b/ocaml/sudoku.ml
@@ -0,0 +1,29 @@
+(* Jon Harrop's Sudoku Solver in 19 lines of code, from:
+ * http://www.ffconsultancy.com/ocaml/sudoku/index.html
+ *)
+
+let m = Array.init 9 (fun _ -> input_line stdin)
+
+let print() = Array.iter print_endline m
+
+let rec invalid ?(i=0) x y n =
+  i<9 && (m.(y).[i] = n || m.(i).[x] = n ||
+      m.(y/3*3 + i/3).[x/3*3 + i mod 3] = n || invalid ~i:(i+1) x y n)
+
+
+let rec fold f accu l u = if l=u then accu else fold f (f accu l) (l+1) u
+
+let rec search ?(x=0) ?(y=0) f accu = match x, y with
+    9, y -> search ~x:0 ~y:(y+1) f accu (* Next row *)
+  | 0, 9 -> f accu                      (* Found a solution *)
+  | x, y ->
+      if m.(y).[x] <> '0' then search ~x:(x+1) ~y f accu else
+        fold (fun accu n ->
+                let n = Char.chr (n + 48) in
+                if invalid x y n then accu else
+                  (m.(y).[x] <- n;
+                   let accu = search ~x:(x+1) ~y f accu in
+                   m.(y).[x] <- '0';
+                   accu)) accu 1 10
+
+let () = Printf.printf "%d solutions\n" (search (fun i -> print(); i+1) 0)