2 ms·
This reminds me a lot of the section on constraint-satisfaction problems from an AI class I took a while back. You can solve constraint satisfaction problems us
by tikhonj 14y ago
This reminds me a lot of the section on constraint-satisfaction problems from an AI class I took a while back. You can solve constraint satisfaction problems using backtracking, but this is very difficult--it takes exponential time. However, for certain problems (like the well-known n-queens problem), the optimal way to solve it is to start with a random configuration and jiggle it around.
This is the same thing but with people instead of CSP-solving algorithms.
- sherm8n 14y agoOmg, do you remember solving shortest path graphs by hand?
- kybernetikos 14y agoI wanted to learn about constraint-satisfaction algorithms, so I implemented dancing links in javascript. If you're interested, you can see it at http://dancing-links.herokuapp.com/ http://dancing-links.herokuapp.com/ and the source is on github https://github.com/kybernetikos/dancing-links https://github.com/kybernetikos/dancing-links