Probably Good Enough

Today Nala and Henri are on a relay race to reach a shared goal: cookies!

Normal Sudoku rules apply: Place the digits 1-9 in every row, column and box exactly once each.

The grid is partially covered in fog. Placing correct digits will clear the fog from surrounding cells, possibly revealing more clues.

This puzzle is solved in 2 parts. The grey line in row 5 is a fence that the dogs don’t cross. Every clue above that line has to be fulfilled correctly, while every clue below that line has to be fulfilled wrogn!

Build a path that starts at Nala, leads to Henri to hand over the ball, and then takes Henri with the ball to the finish, so they both get their cookies. The path moves orthogonally and starts at Nala, passes through Henri, and ends at the cookies. It cannot touch itself orthogonally, but can do so diagonally. Adjacent digits along the path alternate between odd and even.

Part 1: Nala:

• digits along an arrow must sum to the digit in the corresponding circle.
• every digit that appears in a (larger) white circle must also appear in at least one of its 4 surrounding cells.
• digits in a dashed cage must sum to the number in the top left corner of the cage. Digits may not repeat within their own cage.
• all cells of all dashed cages are part of the path Nala takes
• digits separated by a white dot are consecutive. Digits separated by a black dot are in a 1:2 ratio. Not all possible dots are given. (There is no negative constraint.)
• adjacent digits on a green whisper line differ by at least 5

Part 2: Henri Starting from Henri, all clues are standard, but all clues need to be wrong, including the parity path, i.e. no adjacent digits along the parity path alternate between odd and even. A quad clue is considered wrong if none of its digits appear in the 4 surrounding cells and a green whisper line is considered wrong if no adjacent digits on it differ by 5 or more.