Some of you may know this one already...
It's called the MU puzzle, and it is as follows:
You have the symbols M, I, and U. You combine them to make words. You start with the word MI and you have to try to convert it to MU, using the following transformation rules:
1. Add a U to the end of any string ending in I. For example: MI to MIU.
2. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU.
3. Replace any III with a U. For example: MUIIIU to MUUU.
4. Remove any UU. For example: MUUU to MU.
Rules do not have to be followed in order. For instance, you could apply either rule 2 or rule 1 first. Additionally, you cannot use a rule if you cannot apply the rule. The rule must be applied exactly as it is stated.
So, using the parameters above, can you convert MI to MU, in a finite amount of steps? If you can, can you show the steps? Or at least write down the number of rules, in order, to solve the puzzle?
It's called the MU puzzle, and it is as follows:
You have the symbols M, I, and U. You combine them to make words. You start with the word MI and you have to try to convert it to MU, using the following transformation rules:
1. Add a U to the end of any string ending in I. For example: MI to MIU.
2. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU.
3. Replace any III with a U. For example: MUIIIU to MUUU.
4. Remove any UU. For example: MUUU to MU.
Rules do not have to be followed in order. For instance, you could apply either rule 2 or rule 1 first. Additionally, you cannot use a rule if you cannot apply the rule. The rule must be applied exactly as it is stated.
So, using the parameters above, can you convert MI to MU, in a finite amount of steps? If you can, can you show the steps? Or at least write down the number of rules, in order, to solve the puzzle?
Comment