Блог пользователя saazz

Автор saazz, история, 6 часов назад, По-английски

Okay, so I recently fell down a rabbit hole with this game — and I genuinely can’t stop thinking about it.

It’s Tic Tac Toe… but with a twist.

Every move you make decides where your opponent has to play next. So you're not just thinking about your move — you're constantly setting traps… or accidentally walking into them.

Sounds simple. It’s not.

That’s what makes it so addictive.

I made a quick short explaining it — check it out: https://youtube.com/shorts/cj4HM6qs6dE

  • Проголосовать: нравится
  • +3
  • Проголосовать: не нравится

»
6 часов назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

i've played this game before, and it last for 40 minutes to finish the game! i lost:( but it's kinda fun tho

»
6 часов назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

is it possible to make an undefeatable coded opponent for this game

  • »
    »
    5 часов назад, скрыть # ^ |
     
    Проголосовать: нравится 0 Проголосовать: не нравится

    It's a game with a deterministic game tree, so there exists a deterministically undefeatable opponent for at least one side (starting first or starting second), possibly both.

    • »
      »
      »
      5 часов назад, скрыть # ^ |
       
      Проголосовать: нравится 0 Проголосовать: не нравится

      but yet isnt the complexity unfeasible

      • »
        »
        »
        »
        5 часов назад, скрыть # ^ |
        Rev. 2  
        Проголосовать: нравится +1 Проголосовать: не нравится

        Probably not. Intuitively there aren't very many possible positions, because moves are very forcing. So even DP on all possible positions is probably doable in at most a few days.

        Furthermore, once you have run this once, now you can make a faster program which only contains the positions which are achievable assuming one side plays optimally. This should be extremely fast.

        Edit: I lied, Wikipedia says that perfect algorithms are too slow; I guess my intuition on the complexity was off. However, there are computer algorithms which are strong enough to consistently beat humans. See here.

»
6 часов назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Oh it's that one game from Vsauce

I actually played this with my little brother, and also with some friends

I like it, I just wish it didn't take so long.

»
6 часов назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

nice idea for a problem