Genetic Solving

Watch a genetic algorithm and simulated annealing solve a placement puzzle.

How does a genetic algorithm solve a hard problem? GeneticSolving shows it live, on floorplanning: placing a mesh of connected cells as compactly as possible, as square as possible, with the shortest connections — the problem chip designers face.

• Watch the best layout of a population improve step by step
• Colours show where each cell belongs: the ideal layout is a smooth gradient
• Show the connections, zoom in, run, pause or advance one generation
• A cost curve shows the progress towards the ideal
• The demo solves a 4×4 mesh with genetic algorithm + simulated annealing

The full version (GeneticSolving) lets you choose the mesh size, the method — genetic, simulated annealing or both — the population and the weights of the cost function, and race several populations side by side.

No ads, no account, no data collected.

Demo · Full version