eigenMax

How to Play

Optimize the kth largest eigenvalue (λₖ) of the graph's adjacency matrix. You have 20 turns or a limited time to maximize the value.

• Click on a node to select it, then click on another node to add or remove an edge.
• The graph must remain connected at all times.
• Each eigenvector entry is displayed at its corresponding vertex.
• Your score is based on how much you improve the target eigenvalue from its initial value.