  The problem of completing a partially specified n by n Latin square is solved
by an alternative proof, based on filling the rows (or diagonals) from 1 to n,
using an extended form of Hall's marriage theorem.
