Spectral Graph Puzzle

eigenMax

Tune a connected graph by adding and removing edges. Your score rises when the selected adjacency eigenvalue beats its starting value.

Goal

Maximize λ_k without disconnecting the graph. Click one vertex, then another, to toggle the edge between them.

Difficulty

Target

Mode

Difficulty Medium

Target λ1

Initial 0.0000

Current 0.0000

Improvement 0.0000

Turns Left 20

Time 3:00

Select two vertices to add or remove an edge.

How to play

Click vertices to add or remove an edge between them.
Drag vertices if the graph needs breathing room.
White labels are entries of the target eigenvector.
Connected only: moves that split the graph are blocked.

High Scores (Medium)

No scores yet

Game Over!

Your score: 0.00

You improved λ₀ from 0.00 to 0.00

You made the high score list!