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.

While I can't call any concise since that would be for you to judge I do find many articles and even videos on the subject matter with https://www.google.com/search?q=minimax+algorithm

Now that there are some hundred plus pages available your job is to find the one that speaks to you.