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.