Symbolic Resonance Engine
Built-in Problems
Custom Problems
No custom problems yet
Create your own problem to get started
Selected Problem
Traveling Salesman Problem
Find the shortest route visiting all cities exactly once
Maximum number of iterations before the engine stops. Higher values allow more time for convergence but increase computation time.
Probability threshold for considering the question space collapsed. Higher values require more certainty before stopping.
Rate at which entropy decreases, promoting collapse to a single answer. Higher values lead to faster convergence.
Amount of random fluctuation in the quantum amplitudes. Simulates quantum uncertainty and prevents getting stuck in local minima.
Enable prime-based resonance calculations using logarithmic phase relationships. This is the core innovation of the Symbolic Resonance Engine.
Prime resonance active: Using e^(2πi*log_p(q)) for complex amplitude calculations