2016 Update

Task/Dinesmans-multiple-dwelling-problem/JavaScript/dinesmans-multiple-dwelling-problem-1.js

@@ -0,0 +1,54 @@
+(() => {
+    'use strict';
+
+    // concatMap :: (a -> [b]) -> [a] -> [b]
+    const concatMap = (f, xs) => [].concat.apply([], xs.map(f));
+
+    // range :: Int -> Int -> [Int]
+    const range = (m, n) =>
+        Array.from({
+            length: Math.floor(n - m) + 1
+        }, (_, i) => m + i);
+
+    // and :: [Bool] -> Bool
+    const and = xs => {
+        let i = xs.length;
+        while (i--)
+            if (!xs[i]) return false;
+        return true;
+    }
+
+    // nubBy :: (a -> a -> Bool) -> [a] -> [a]
+    const nubBy = (p, xs) => {
+        const x = xs.length ? xs[0] : undefined;
+        return x !== undefined ? [x].concat(
+            nubBy(p, xs.slice(1)
+                .filter(y => !p(x, y)))
+        ) : [];
+    }
+
+    // PROBLEM DECLARATION
+
+    const floors = range(1, 5);
+
+    return  concatMap(b =>
+            concatMap(c =>
+            concatMap(f =>
+            concatMap(m =>
+            concatMap(s =>
+                and([ // CONDITIONS
+                    nubBy((a, b) => a === b, [b, c, f, m, s]) // all floors singly occupied
+                    .length === 5,
+                    b !== 5, c !== 1, f !== 1, f !== 5,
+                    m > c, Math.abs(s - f) > 1, Math.abs(c - f) > 1
+                ]) ? [{
+                    Baker: b,
+                    Cooper: c,
+                    Fletcher: f,
+                    Miller: m,
+                    Smith: s
+                }] : [],
+                floors), floors), floors), floors), floors);
+
+    // --> [{"Baker":3, "Cooper":2, "Fletcher":4, "Miller":5, "Smith":1}]
+})();

Task/Dinesmans-multiple-dwelling-problem/JavaScript/dinesmans-multiple-dwelling-problem-2.js

@@ -0,0 +1 @@
+[{"Baker":3, "Cooper":2, "Fletcher":4, "Miller":5, "Smith":1}]

Task/Dinesmans-multiple-dwelling-problem/JavaScript/dinesmans-multiple-dwelling-problem-3.js

@@ -0,0 +1,55 @@
+(() => {
+    'use strict';
+
+    // concatMap :: (a -> [b]) -> [a] -> [b]
+    const concatMap = (f, xs) => [].concat.apply([], xs.map(f));
+
+    // range :: Int -> Int -> [Int]
+    const range = (m, n) =>
+        Array.from({
+            length: Math.floor(n - m) + 1
+        }, (_, i) => m + i);
+
+    // and :: [Bool] -> Bool
+    const and = xs => {
+        let i = xs.length;
+        while (i--)
+            if (!xs[i]) return false;
+        return true;
+    }
+
+    // permutations :: [a] -> [[a]]
+    const permutations = xs =>
+        xs.length ? concatMap(x => concatMap(ys => [
+                [x].concat(ys)
+            ],
+            permutations(delete_(x, xs))), xs) : [
+            []
+        ];
+
+    // delete :: a -> [a] -> [a]
+    const delete_ = (x, xs) =>
+        deleteBy((a, b) => a === b, x, xs);
+
+    // deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]
+    const deleteBy = (f, x, xs) =>
+        xs.reduce((a, y) => f(x, y) ? a : a.concat(y), []);
+
+    // PROBLEM DECLARATION
+
+    const floors = range(1, 5);
+
+    return concatMap(([c, b, f, m, s]) =>
+        and([ // CONDITIONS (assuming full occupancy, no cohabitation)
+            b !== 5, c !== 1, f !== 1, f !== 5,
+            m > c, Math.abs(s - f) > 1, Math.abs(c - f) > 1
+        ]) ? [{
+            Baker: b,
+            Cooper: c,
+            Fletcher: f,
+            Miller: m,
+            Smith: s
+        }] : [], permutations(floors));
+
+    // --> [{"Baker":3, "Cooper":2, "Fletcher":4, "Miller":5, "Smith":1}]
+})();

Task/Dinesmans-multiple-dwelling-problem/JavaScript/dinesmans-multiple-dwelling-problem-4.js

@@ -0,0 +1 @@
+[{"Baker":3, "Cooper":2, "Fletcher":4, "Miller":5, "Smith":1}]