471 - experiment: chessboard app

No tests. Let's have some fun.
As a first step, a 'list-length' function. Iterative version is 25% faster
than recursive (60 vs 45 seconds).

1 files changed, 25 insertions, 0 deletions

diff --git a/chessboard.mu b/chessboard.mu
new file mode 100644
index 00000000..bba3a3ad
--- /dev/null
+++ b/chessboard.mu
@@ -0,0 +1,25 @@
+(function read-board [
+  (default-scope:scope-address <- new scope:literal 30:literal)
+  (initial-position:list-address <- init-list R:literal N:literal B:literal Q:literal K:literal B:literal N:literal R:literal
+                                              P:literal P:literal P:literal P:literal P:literal P:literal P:literal P:literal
+                                              _:literal _:literal _:literal _:literal _:literal _:literal _:literal _:literal
+                                              _:literal _:literal _:literal _:literal _:literal _:literal _:literal _:literal
+                                              _:literal _:literal _:literal _:literal _:literal _:literal _:literal _:literal
+                                              _:literal _:literal _:literal _:literal _:literal _:literal _:literal _:literal
+                                              p:literal p:literal p:literal p:literal p:literal p:literal p:literal p:literal
+                                              r:literal n:literal b:literal q:literal k:literal b:literal n:literal r:literal)
+  ; assert(length(initial-position) == 64)
+  (len:integer <- list-length initial-position:list-address)
+  (print-primitive len:integer)
+  (reply)
+;?   (b:board <- read-board initial-position:list)
+;?   (print-board b:board)
+])
+
+(function print-board [
+
+])
+
+(function main [
+  (read-board)
+])