Mini Max Algorithm Explained For Tic Tac Toe Game in Python | Tic Tac Toe - 7

Поделиться
HTML-код
  • Опубликовано: 21 янв 2025

Комментарии • 8

  • @themessiahiscoming6158
    @themessiahiscoming6158 Год назад +1

    Great explanation. I appreciate the details put into this video

  • @pawankumaryadav8127
    @pawankumaryadav8127 10 месяцев назад +1

    what an explanation bro. 😃

  • @SmortMen
    @SmortMen 5 месяцев назад +1

    Can i just do this whole algorithm in my brain and win or draw everytime.

    • @visheshprogramming
      @visheshprogramming  2 месяца назад

      Yes, that is actually how we play but we don't realize what our brain is processing/visualization. Person who can visualize deep nodes always wins the game. Same thing for chess.

  • @karthikkethavath375
    @karthikkethavath375 Год назад +1

    hello bro ..iam really doing hard since a week about this algorithm...i understood the case but i didnt understood the code ...if you are ok can i get instgram handle ..so that i can contact you ??? plzzz

    • @visheshprogramming
      @visheshprogramming  Год назад

      Yeah I will be happy to help you if you still didn't understood it.

    • @mannmeraa
      @mannmeraa 10 месяцев назад

      @@visheshprogramming where to contact ?