Not quite a daily game, but I'm stuck and wondering if anybody else can spot the answer. The puzzle should be doable logically without guessing or brute forcing.
Rules:
Your task is to build a tower on every square, in such a way that:
Each row contains every possible height of tower once Each column contains every possible height of tower once Each numeric clue describes the number of towers that can be seen if you look into the square from that direction, assuming that shorter towers are hidden behind taller ones. For example, in a 5Γ5 grid, a clue marked β5β indicates that the five tower heights must appear in increasing order (otherwise you would not be able to see all five towers), whereas a clue marked β1β indicates that the tallest tower (the one marked 5) must come first.
Source: Simon Tatham's Puzzles. Amazing FOSS time sink.
Edit:
Spoiler
Solved! Tile B3 cannot be 4, since that would violate the constraint from the bottom.
