Tree Tent Graphical Rules

To represent a tile that can be either grass or a tree, I will use the following representation:
Rule 1
If n = k, every other tile in this row or column is grass.
Rule 2
A tent cannot have any other tents adjacent to it. Therefore, each tile around a tent is either a tree, or grass. Since the user cannot place trees, it can be assumed that every unknown tile around a tent is grass.
Rule 3
If there are only (n - k) possible tent placements in a given row or column, then there are tents on them.
Rule 4
If a tree is surrounded on three sides by other trees or grass, then there must be a tent in the only remaining square.
Rule 5
If the number of trees on any given side of a row or column is equal to the number of total tents there, less the number of total tents in the given row or column, there are tents on that side of all trees in that row.

That is, if Σtside = Σnside - t, Then there are tents on the given side of all t trees in the selected row or column.

This can also be applied the other way: If Σtside = Σnside, then there are NO tents on this side of the given row or column.