And here’s a Geradeweg with unequal lengths.
Rules Solve as a regular Geradeweg. In addition, any two straight segments which meet at a point must have different lengths.
This past weekend, the WPF hosted round 4 of the 2019 Puzzle Grand Prix, with puzzles by Russian authors. Puzzles/solutions/results are currently available under the previous link but should show up in the archive eventually. I’ll go over how it went for me below. One very interesting new variant on the test was “unequal lengths slitherlink”; here’s one:
Rules Solve as a regular slitherlink. In addition, any two connected straight line segments must have different lengths.
I’ve wrapped up my recent changes to pzprjs in a new release, full changelog below. It’s live now on puzz.link. Please let me know if you find any bugs, or would like to contribute some missing translations.
The latest addition is the Nikoli puzzle type Scrin (スクリン); here’s a small sample puzzle:
Rules Draw some rectangles, such that every clue is inside a rectangle (of the given size if specified). Different rectangles can only touch by corners, and all rectangles must form a single non-branching loop via these corner-connections. Rectangles without clues are possible. Continue reading
Rules Fill the empty cells of the grid by drawing rectangles that consist of horizontal and vertical lines between cell centers. The sides of different rectangles may intersect but not overlap. Rectangles can’t touch otherwise; in particular, they can’t touch by a corner.