Loop with Symmetrical Segments
Draw a single closed loop along the grid lines. The loop visits every vertex of the grid exactly once and consists of segments with central symmetry. The centers of symmetry of all the segments are given. Each segment starts and ends in one of the grid vertices. The segments may not overlap.
(Rules and Example from WPC 2018 IB)
History of the puzzle
Probably invented by Jiří Hrdina (Czech Rep.) for WPC 2018/Round 7.
Appearances in the past WPCs
- WPC 2018/Round 7 by Jiří Hrdina