Hi, in this video we take a deep dive into coding tic tac toe game in python, but we are not stopping at the basics. The most interesting part of the video, imo, is the optimization of the check winner function, implemented with a time complexity of O(1).
If you enjoyed the video, please give it a thumbs up and consider subscribing.
thanks
something about me : I'm a recent graduate in computer science and engineering, currently working as a software engineer. I started this channel to share my passion for coding, helping others understand complex computer science concepts, and sparking interest in problem-solving and competitive programming.
chapters = {
00:00 introduction,
01:18 main function,
02:16 get_board_size() function,
03:25 get_nicknames() function,
05:40 print_board() function,
10:00 game's while loop,
11:45 get_move() function,
17:50 explanation of the optimization for checking the winning condition in O(1) time,
29:10 check_win() function,
35:30 win and draw messages,
36:43 testing and outro,
}