Jul 8, 2021
Tres en raya a otro nivel
I would call this n-dimensional non-consecutive tic-tac-toe. Where n is the number of matryoshka dolls where one matryoshka covers another. Or nesting count.
Usually there is a finite number of combinations in tic-tac-toe, with a minimum of 3 moves to win, but the number of combinations would increase for every overlap/nesting a doll makes. And the minimun number of moves would depend on number of matryoshka dolls.
Also lets not forget the combinations in which the dolls can nest, if you remember fron middle school (highschool for you westeners) it a factorial math problem. Which is always fun to do!
