A "non-Euclidean" skyscraper Sudoku
Play on Itch.io:
Rules (more in depth in app):
1) Shade some boxes as "city parks" such that every rank contains one park. Do not place any additional digits in parks
2) In remaining boxes, place the digits 1-9 without repeating so every rank contains each digit without repeat. Each digit represents a skyscraper with height equal to the value of the digit. Taller skyscrapers obscure the view of smaller ones (note given digits in parks do not count towards this requirement)
3) Given digits in "city parks" are skyscraper clues, and give the total number of skyscrapers visible from that spot in ALL directions.
This is my debut puzzle. Any feedback is appreciated, whether it's about the setting or interface I programmed.