MMM Setting the Key

My explanation of setting the key. TLDR it's a binary switch problem where you have 8 teeth that are either inserted or removed. You need to figure out which state each of the 8 teeth need to be in. The easiest way to do this is to set every tooth to inserted, get the count, and if it is less than or equal to 4 just play the process of elimination game to figure out which teeth need to be removed, one at a time.

[@nitroplr]

If anyone who does this could let me know if they all start either removed or inserted that could save the first step of toggling all of the teeth initially to ensure they are all set to one value.