MathDB

Richard starts with the string

HHMMMMTT

. A move consists of replacing an instance of

HM

with

MH

, replacing an instance of

MT

with

TM

, or replacing an instance of

TH

with

HT

. Compute the number of possible strings he can end up with after performing zero or more moves.

Problem Statement