fizbin

/*
 * This program solves the puzzle
 *     https://perl.plover.com/qotw/e/021
 *
 * (In case that link goes away, a brief summary of the problem
 * is to consider the free non-abelian group with 26 generators
 * 'a' through 'z', under the equivalence relation that any two
 * words found in the dictionary that are anagrams of each other
 * are equivalent. Now determine which letters commute with which
 * other letters, and specifically which letters are in the center.)

fizbin

.386
.model flat, stdcall
.stack 4096

    ; My dad was in the computer industry for 45 years; in addition to
    ; his day job, he supplemented his income while my siblings and I
    ; were in college with teaching night classes at the local community
    ; college. One of the classes he taught was assembly language
    ; programming, and something he'd have his students do near the end
    ; of the term was write a program that asked the user to enter a