How to Solve Akari Puzzles
Place light bulbs to illuminate every cell in the grid. Clues indicate the number of orthogonally adjacent bulbs.
These are our in-depth tutorials for puzzles, with more being added once they’ve appeared in one of our books. The table of contents in our puzzle books will include a thumbnail of the type of puzzle, and a QR code, which will take you directly to its tutorial page. Variants with no significant change in solving technique, such as some Sudoku puzzles with extra regions, will appear at the bottom of the main tutorial page with a brief explanation of what is different.
Place light bulbs to illuminate every cell in the grid. Clues indicate the number of orthogonally adjacent bulbs.
Draw a single closed loop that passes through every cell without branching or crossing itself. It makes a right-angle turn in every circle, and exactly one turn between each pair of circles.
Label all the arrows with a number from 1 to X (X is the highest possible number) showing the correct sequence of arrows. Each arrow points to the next in the sequence, but it’s not necessarily adjacent.
Connect each pair with a line that only travels orthogonally. These paths do not cross and might not use every cell in the grid.
Place a fleet into the grid using the clues around the edge. Ships may not touch each other in any direction.
Place numbers from 1 to N (N being the size of the grid) such that there are no duplicates in rows or columns. Each brick must have both an odd and an even number.
Place numbers from 1 to N (N being the size of the grid) such that there are no duplicates in rows or columns. Each region has a total that must be reached by applying an operator to all digits in the region.
Use clues to solve a code between 3 and 5 digits long.
Fill in the grid with the numbers 1-9 such that there are no duplicates in any row, column, or 3×3 region. Inequality symbols between adjacent cells indicate which cell has the greater number.
Divide a grid of numbers by locating the correct position for all possible dominoes in a given set.