I created this puzzle for the CTC december setting prompt on discord, which tasked setters to create small puzzles. I had originally envisioned this ruleset in a 4x4 grid but as far as I can tell, that is actually impossible (if someone has a proof that doesn't use trial by error, I'd be curious to see it).
Place the digits 1-6 once each into every row, column and 2x3 box.
Shade all cells whose digit matches its row, column or box number. All other cells must be unshaded.
A digit in a cell with an arrow indicates how many shaded cells are seen in the direction of the arrow, including the arrow cell itself.
Draw a single closed loop, which moves orthogonally (without intersections or crossings) through all unshaded cells.
Solution code: The digits in row 2 (from left to right), followed by the total number of shaded digits in the completed grid.
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.