IT-450
Prof. Gebril
February 7, 2021
Milestone Three
Proposed AI single solution:
After playing and studying the AI in this checkers game for five weeks now I feel that it
is too simple to defeat. A possible solution to this problem is implementing an Alpha-Beta game
search tree. Which is a search tree part of the minimax method, to my understanding from our
book this implementation will increase the difficulty of the AI due to its new ability to find
various solutions throughout the game.
Determine which of the considered and applied solutions you feel is appropriate and
formulate your defense and explanations to convince your AI and non-AI professional
audience.
Implementing an Alpha-Beta search tree will drastically change the outcome and skill
level of the AI in the codio checker’s game. In the current state of the game the AI is set up to
read off a list of moves (Figures 1 & 2) and doesn’t really see any move in advance, it only plays
in the moment. Using this more advanced method would take each move into account and play
off of that rather than just moving through a list and basing moves off of who has more pieces.
Having the AI value each position and move of the opposing player can help gather more
information on what the next move will be so the AI can prepare and plan to attack or counter.
Implementing this minimax method is far more advanced than the heuristic method applied now.
This study source was downloaded by 100000850872992 from CourseHero.com on 03-30-2023 17:38:34 GMT -05:00
https://www.coursehero.com/file/101655459/Module-Five-Milestone-Threedocx/
Prof. Gebril
February 7, 2021
Milestone Three
Proposed AI single solution:
After playing and studying the AI in this checkers game for five weeks now I feel that it
is too simple to defeat. A possible solution to this problem is implementing an Alpha-Beta game
search tree. Which is a search tree part of the minimax method, to my understanding from our
book this implementation will increase the difficulty of the AI due to its new ability to find
various solutions throughout the game.
Determine which of the considered and applied solutions you feel is appropriate and
formulate your defense and explanations to convince your AI and non-AI professional
audience.
Implementing an Alpha-Beta search tree will drastically change the outcome and skill
level of the AI in the codio checker’s game. In the current state of the game the AI is set up to
read off a list of moves (Figures 1 & 2) and doesn’t really see any move in advance, it only plays
in the moment. Using this more advanced method would take each move into account and play
off of that rather than just moving through a list and basing moves off of who has more pieces.
Having the AI value each position and move of the opposing player can help gather more
information on what the next move will be so the AI can prepare and plan to attack or counter.
Implementing this minimax method is far more advanced than the heuristic method applied now.
This study source was downloaded by 100000850872992 from CourseHero.com on 03-30-2023 17:38:34 GMT -05:00
https://www.coursehero.com/file/101655459/Module-Five-Milestone-Threedocx/
