Setup and opening position
The outer vertices carry alternating black corner pearls and white side pearls, the center is unmarked, and the twelve orthogonal links begin undecided. The generated instance has one verified completion.
Classify every link so a single loop obeys all eight pearl constraints.
Your unfinished game is saved only in this browser.
Classify every link so a single loop obeys all eight pearl constraints.
Complete guide
Pearl Loop is a complete browser implementation with its own versioned rules profile. Form one loop through black and white pearls on a compact 3×3 vertex grid.
The outer vertices carry alternating black corner pearls and white side pearls, the center is unmarked, and the twelve orthogonal links begin undecided. The generated instance has one verified completion.
The selected links form one degree-two cycle. The loop turns on every black pearl and continues straight through both neighboring vertices; it runs straight through every white pearl and turns at least once immediately before or after it.
Classify every link so a single loop obeys all eight pearl constraints. Trace pearl by pearl and verify the neighboring behavior as well as the shape at the marked vertex before accepting the final connection.
Black corners immediately determine both incident loop links. Use those forced straight continuations to test which adjacent direction can satisfy each white pearl. A white pearl requires a nearby turn, not a turn on the pearl itself; a black pearl requires straight travel on both sides of its turn.
Classify every link so a single loop obeys all eight pearl constraints.
The selected links form one degree-two cycle. The loop turns on every black pearl and continues straight through both neighboring vertices; it runs straight through every white pearl and turns at least once immediately before or after it.
Black corners immediately determine both incident loop links. Use those forced straight continuations to test which adjacent direction can satisfy each white pearl.