Alpha-Beta Pruning for the Minimax Algorithm in the Tic-Tac-Toe Game

Поділитися
Вставка
  • Опубліковано 26 лис 2024

КОМЕНТАРІ • 9

  • @whoismaverick
    @whoismaverick 2 роки тому +1

    Thanks for this video your explanations were very clear, it helped me a lot !

  • @unrealdevop
    @unrealdevop 2 роки тому +2

    Say I just tried this exactly like you did and I must be doing something wrong because It's breaking everything. I even tried using the pseudo code example off the wiki and it didn't work either and I even tried another one I found and it still doesn't work...
    Am I supposed to be passing these values by reference? No body explains if I'm supposed to have a global variable for Alpha/Beta or local ones that get set by the value passed down the chain.
    What I'm doing is passing in the value, setting the local variables, then running down the chain, when it gets passed back up the score is checked and the min gets set to beta for the minimizer or the max gets set to alpha for the maximizer...then if alpha is greater than or equal to beta then I break the for loop...it's not working though. The computer just keeps trying to place a marker where there already is one.

    • @unrealdevop
      @unrealdevop 2 роки тому

      Update: I figured it out, I got it fully operational now and with Alpha/Beta pruning by debugging with your board configuration and moving through step by step like you do. Thanks again for the video and breakdown.

  • @unrealdevop
    @unrealdevop 2 роки тому

    Nice explanation. Hope to see more videos from you in the future

  • @akhil-menon
    @akhil-menon Місяць тому

    Really helpful!

  • @motivationalquotes7748
    @motivationalquotes7748 8 місяців тому

    How the child minimizer score is -1

  • @mayonesacosmica
    @mayonesacosmica Рік тому

    when going from node e to node b, shouldn't the score be updated to 1?

    • @mayonesacosmica
      @mayonesacosmica Рік тому

      no, because we're looking for the min not the max in that case