awan1 / mu-puzzle Goto Github PK

Provide an implementation that creates one node in the browser, and then you click on a node to do "step" on that node. It'd be cool to see the graph grow.

• interactive window could also have a "advance" button that calls step on the next shortest vertex

For each rule, the implementation should take a string and output all strings that can be created by applications of the rule. The output can be an empty iterable.

Tests should be written for each rule.

The problem can be thought of generating a directed graph: a node is a (in-system) string, an edge is a rule application. Solving the problem is equivalent to starting from the given start string, and applying rules to generate the graph until a node containing the ending string is reached.

The logic implemented here should take a start string, an end string, and a ruleset, and on each iteration:

• Find the node closest to the start
• Generate all nodes reachable from the current node
• For all new nodes, add them to the graph. For all existing nodes, add an edge to that node.
• If a node is generated that matches the end string, exit the loop
• On interruption (e.g. by SIGINT or timeout) or on exit, return the graph.

Testing: run the loop for a small number of iterations, manually inspect output. Can codify these into unit test cases, though it might not be worthwhile.

• unit tests that assert solver behavior for a single step.
• type cleanups

Would be nice for people viewing the code to be able to see the code work without having to clone the repo

When run, the entry point should eventually output a solution. It can output some text for now.