Coin toss game -- probability of winning with a string of results I'm studying probability and came across the following problem:
Alice and Bob are playing a game in which each of them chooses a 4-letter string of $\{H,T\}$ (heads/tails), following which a coin is tossed repeatedly until one of the players' chosen strings appears. When that happens, that player has won.
If Alice chooses the string $THTH$, is there any string Bob can choose with which his probability of winning is greater than $50\%$?
I know that if I'm given a specific string for Bob, I can calculate each player's probability of winning by doing recursive conditional probability, but short of checking each of Bob's 15 possible choices for a string this way I'm not sure how to prove or disprove the assertion that Bob's chance to win can be more than $50\%$.
(I can't find a problem like this anywhere on SE so if this is a duplicate I apologize in advance).

If they play the game many times, and the winner scores each game based on how long it takes their opponent to finish after them, and they add together their scores from each game, then scores will, in the long run, be even.
The trick here is for Bob to pick a sequence such that if he wins, he wins just before Alice finishes her sequence, and if Alice wins, it's a long time until Bob finishes his. That way, since Bob often scores less points than Alice, he must win more often.
With that in mind, I suggest Bob goes for TTHT.
