X's and O's

Logic

Let's play a game! Given a string of X's and O's, you can

  1. Replace any "X" by "XO".
  2. Replace any "XXX" by "OX".
  3. Replace any "OO" by "XOO".

What is the fewest number of steps needed to change the string OOX into OXOOOX?

Andrew Ellinor by Andrew Ellinor
×

Problem Loading...

Note Loading...

Set Loading...