"Finding Needle in a Haystack" Demo

VivaArc™ is a general purpose search methodology...

It works in an energy landscape (an Energy-Minimization Framework) to find extremely rare solutions in enormous spaces. The demo is on one of the most difficult problems in combinatorial search, the Hamiltonian Cycle Problem (an NP-complete problem): find a cycle that visits each vertex exactly once. In theory, all problems with verifiable solutions are reducible to this search problem at the edge of computational impossibility. i

Live Solver Visualization

Catalog

Zoom 1.00x Ready
Gaps
--
Longest Path
--