im an absolute beginner at programming so it would be mighty fine if ppl had a method to contact you, just asking for a friend in the most non formal method youtube comments
More or less yeah, it depends of cause based on the depth of your search and the number of posible actions that can be performed, however there is a lot of optimizations that can be done, forexample alpha-beta prunning (en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning). Sebastian Lague has a great video using a simular technique for playing chess. :) (ruclips.net/video/U4ogK0MIzqk/видео.html&ab_channel=SebastianLague)
A very good tutorial! Keep it up! I just have a problem implementing the win conditions as it keeps giving me an error. Would you happen to have the original code on github by any chance? :D
Thank you! Sadly have not, would propably make sense to do haha, but tbh, my win condition is really not great. I remember just making the biggest if statement checking each combination and concluding that it was "good enought". :D
It still works for 6+ moves, but I could not call it "perfect" in that case. Because if you look even further into the future there might be moves that 12+ moves from now are even better. However, realisticly it would likely not matter for Tic Tac Toe, but still, technically I couldn't call it that then. :)
![Ice On My Teeth - ATEEZ エイティーズ 에이티즈 [Music Bank] | KBS WORLD TV 241115](http://i.ytimg.com/vi/c-n92OgbbwA/mqdefault.jpg)
I wanted to create tic tac toe for myself but I got stuck at making a bot... This video is making life a lot easier!! Great video! 😄👍
Nice tic tac toe :)
im an absolute beginner at programming so it would be mighty fine if ppl had a method to contact you, just asking for a friend in the most non formal method youtube comments
you should make discord
that if you don't already have one if that were to be the case what is it
Wouldn't this alogorithim be really infecient tho if it has to calualte that many different outcomes to find the best?
More or less yeah, it depends of cause based on the depth of your search and the number of posible actions that can be performed, however there is a lot of optimizations that can be done, forexample alpha-beta prunning (en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning). Sebastian Lague has a great video using a simular technique for playing chess. :) (ruclips.net/video/U4ogK0MIzqk/видео.html&ab_channel=SebastianLague)
A very good tutorial! Keep it up! I just have a problem implementing the win conditions as it keeps giving me an error. Would you happen to have the original code on github by any chance? :D
Thank you! Sadly have not, would propably make sense to do haha, but tbh, my win condition is really not great. I remember just making the biggest if statement checking each combination and concluding that it was "good enought". :D
Great effort 👌
yo
why does it only work for 5-6 moves?
It still works for 6+ moves, but I could not call it "perfect" in that case. Because if you look even further into the future there might be moves that 12+ moves from now are even better. However, realisticly it would likely not matter for Tic Tac Toe, but still, technically I couldn't call it that then. :)