Draw a path from the green cell (top-left) to the purple cell (bottom-right). The result of applying operations along the path must equal the target.
Divide the entire grid into rectangles. Each rectangle contains exactly one number equal to its area. Heavy borders show region boundaries you have drawn.
Find 6 hidden words in the letter grid. Words can go in any direction, including diagonals and backwards. The unused letters spell the hidden theme.
Fill empty cells with digits 1βN (where N is grid size). Each highlighted cage must sum to its target. No digit may repeat in any row or column (like Sudoku + Kakuro).
Fill every row, every column, and every 3Γ3 box with the digits 1β9, each appearing exactly once.
The daily puzzle changes per difficulty β four different challenges each day, all uniquely solvable.
Identify a country from its flag in 6 guesses. After each wrong guess one tile of the flag is uncovered, and you get a distance & direction hint.
Place light bulbs in white cells so every white cell is illuminated. Bulbs shine in straight lines (up/down/left/right) until blocked by a black cell.
Group 16 words into 4 sets of 4. Each set shares a single connector word that can precede or follow all four words. Type the connector, then submit.
FIRE β WORKS Β· PLACE Β· SIDE Β· FLY (fireworks, fireplace, fireside, firefly)
Connect every pair of matching colour dots with a pipe. Pipes must fill every cell in the grid and may not cross or overlap.
Delete numbers from the grid so each row's remaining numbers sum exactly to that row's target. Every row must keep at least one number.
Paint every region using only four colours so no two regions that share a border have the same colour. Some regions are pre-coloured as locked constraints.
A famous quote is encoded with a consistent substitution cipher. Each symbol stands for one letter β always the same one. Decode the entire quote.
Fill all white squares with letters to complete the archived across and down answers for the selected date.
Use the date arrows to browse the crossword archive stored in the project's Crosswords folder.
Transform the start word into the target word by changing exactly one letter at a time. Every step must be a real English word.
Arrange the historical events in chronological order, from earliest to latest.
Fill the grid with 0s and 1s following all three rules.
Fill the grid so each row and column contains each number from 1 to N exactly once, and all inequality signs are satisfied.