0

Hello guys, I need a concise explanation of the minimax algorithm... I understand it perfectly when explained with trees but the confusion comes in the code implementation...
How do I get to implement depth search using code? I understand that calling minimax follows a recursive pattern but getting the AI to search for possible moves has got me stuck... I read PDF files and watch tutorials but I only understand the aspect of search trees. The pseudocode aspect has got me befuddled.

2
Contributors
1
Reply
18
Views
2 Months
Discussion Span
Last Post by rproffitt
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.