Find a way that travels from dot to dot, horizontally and vertically only, and ends where it began, never touching or crossing itself. The numbers indicate the number of adjacent corners where the path bends 90 degrees.
Draw a circular path on the grid line. Not all grid points must be used. But all the red and blue dots are on the path. The lengths of the edges of the path are 1 or 2. On a blue circle meet two lines of equal length each other with a right angle. At red circles two lines of different lengths meet each other with a right angle.
Find a way that travels from dot to dot, horizontally and vertically only, and ends where it began, never touching or crossing itself. The numbers that have been placed in the diagram tell you how many of the four sides of the "square" it lies in are used for the path. (The path doesn't necesserily need to touch all of the dots.)
This angel painted with an apron that bears a miners head. But from the Erzgebirge Christmas customs they are indispensable and they reflect the desire of the miners to light. Today these figures are often somewhat swaggering because these figures represent the number of girls and boys in the household and even in the Erzgebirge not all families have two children.
The miners left the apartment at night in winter, and returned after dark. Angel and miner with their candles had to help the miners to find the way home. And you have also to find a way in our puzzle:
Number the boxes 1 to 31. Some numbers are already given. An arrow in a cell points in the direction in which there is a cell with the next number. Each cell must be used exactly once.
Mountain parades of miners are an integral part of Christmas traditions in the Erzgebirge. They have their origin in the Silver City of Freiberg, where the first parade was presented in December 1557 in honor of the Saxon Elector Augustus I. All slightly larger villages take part and almost every town and some villages of the Erzgebirge have a mountain parade.
Draw the path of the mountain parade. The rules are:
A popular motif of Nutcrackers are Olbernhauian riders. Our rider has ridden on the puzzle grid, but which way he has taken?
Draw the bridle path, with the following rules:
Fish plays at Christmas in the Erzgebirge a large role. Fish belongs to the mandatory parts of Neinerlaa, the most important feast of Christmas on Christmas Eve. Yes, the Erzgebirgians eat at Christmas herring. The feast must contain something that can fly, as well as something that can walk on earth and something that can swim. Since it is no wonder that there are also incense smokers of fisherman profession. Our puzzle is also about fishing.
All fish in the grid is already caught and hung from a hook. The anglers are outside of the grid. There places are marked with numbers. A number indicates how long the fishing line. The field with the fish is included in this total. Fishing lines running horizontally and vertically (not diagonally). They do not cut as well as not overlap. Each fish hangs on just one hook. Draw the location of the fishing lines!
Connect in the left grid all dots in pairs in such a way that all cells are filled. Each straight line must be at least 2 cells long. After that fill in the right grid so that every row, every column and every 3x3 box contain the digits 1 through 9. If two cells are in the left grid in the same path (snake) then the corresponding cells in the right grid must be different.
Connect in the left grid all dots in pairs in such a way that all cells are filled. Each path (worm) has to make a 90 degree turn in every cell it travels through and must contain at least one turn. After that fill in the right grid so that every row, every column, every 3x3 box and both diagonals contain the digits 1 through 9. If two cells are in the left grid in the same path (worm) then the corresponding cells in the right grid must be different.
Connect in the grid all dots in pairs in such a way that all cells are filled. Each path (worm) has to make a 90 degree turn in every cell it travels through and must contain at least one turn.