Hello,
I am trying to solve this problem . But I didn't get the combinatorics used in this solution .How did he conclude that there are (n+1)! states in total?. Also explain me this part:
After checking this game more accurately I can say that the longest path in the state-graph for n = 10 has length 106, so it is enough to do 106 fights, but solutions that did about 40 millions also passed.
Thank you!