Kinnaird-Heether explained it wasn’t a tough programming challenge. He used the Kuhn-Munkres algorithm, which also is known as the Hungarian algorithm; it’s designed to solve assignment problems.