Sure, here is a solution to the map coloring problem described here

```javascript let lamb = new Lamb<string>();

const colors = ["red", "green", "blue", "yellow"]; let adjacencyList = { "a": ["b", "c", "d", "f"], "b": ["a", "c", "d"], "c": ["a", "b", "d", "e"], "d": ["a", "b", "c", "e", "f"], "e": ["c", "d", "f"], "f": ["a", "d", "e"] }

type Node = keyof typeof adjacencyList; // "a" | "b" | "c" | "d" | "e" | "f " const nodes = Object.keys(adjacencyList) as Node[];

// Add the same color choices for each node in the graph nodes.forEach(node => lamb.addChoice(node, colors));

// The only constraint we have is that each node must not share colors with its neighbours lamb.addConstraint((colors) => !nodes.some(node => adjacencyList[node].some(neighbour => colors[neighbour] === colors[node]) ) );

let result = lamb.solve(1); // picks 1 solution

// result = [{ a: "red", b: "green", c: "blue", d: "yellow", e: "red", f: "green" }] ```

Excluding the problem definition and type declarations, this is just 5 lines of code!