But How Do You Actually Do It?
? Write down all of the states that should be given adjacent assignments according to the criteria above ("assignment constraints", or "face embedding constraints.") Then, using a Karnaugh-map, try to satisfy as many of them as possible (or use a computer program which does it: Kiss, Nova, Mustang, Jedi). Some guidelines to help are:
??Assign the starting state to the "0" square on the map (picking a different square doesn't help, since all squares have the same number of adjacencies and it's easier to reset to "0").
??Fanout-oriented guidelines and adjacency conditions required more than once should be satisfied first.
??When guidelines require that 3 or 4 states be adjacent, these states should be placed within a group of 4 on the assignment map.
? If there are only a few outputs, the output guideline should be applied last. If there are lots of outputs and only a few states, then give more weight to the third guideline.