Logic Masters Deutschland e.V.

This is a variant on the anti-taxicab restriction I introduced in my Partial Manhattan Sudoku. After that puzzle was featured on CTC, I was very happy to see people experimenting with the restriction. I had realized that I would require computer assistance to make a complete Manhattan sudoku (since the Partial Manhattan Sudoku was the furthest extent I could reach by hand). I am very grateful to the people on the CTC Discord server, particularly RealShaggy, for finding completed grids with the restriction.

Now, there are examples of anti-taxicab sudokus, such as this one by JGLP. I wanted to introduce some more interplay between the digits. Thus, I made this consecutive sudoku with that restriction. The solution was generated by RealShaggy. Now, onto the puzzle!

Normal Sudoku X rules apply (that is, diagonals contain the digits 1-9 exactly once). If two consecutive digits are adjacent in the completed grid, the edge between them is marked with a white circle. Similarly, if two digits along the two main diagonals are consecutive, they have been separated by a grey dot. All possible white and grey dots are provided.

Additionally, there is an anti-taxicab restriction. That is, if two cells contain the same digit, the taxicab distance (minimum number of orthogonal moves from point A to point B) cannot be equal to that digit. For example, if there is a 4 in R3C4, then there cannot be a 4 in R2C7, since it takes a minimum of 4 moves to go from R3C4 to R2C7.

Here is a Penpa-edit link to try it out online. Hope you enjoy it!