Nearly unbeatable Connect 4 game + AI using minimax with soft-fail alpha-beta pruning

GitHub: https://github.com/LelsersLasers/Comp-Sci-2/tree/main/week17

Work by Millan Kumar and Jerry Huber for Honors Computer Science: Algorithms and Data Structures

Resources

• nextProgram: I made an unbeatable Tic Tac Toe AI (Minimax algorithm)
• Pascal Pons: SOLVING CONNECT FOUR
• Sebastian Lague: Algorithms Explained – minimax and alpha-beta pruning
• Sebastian Lague: Coding Adventure: Chess
• The Coding Train: Minimax Algorithm for Tic Tac Toe (Coding Challenge 154)
• MIT OpenCourseWare: 6. Search: Games, Minimax, and Alpha-Beta