FAQ: Minimax - Evaluating Leaves

This community-built FAQ covers the “Evaluating Leaves” exercise from the lesson “Minimax”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Machine Learning

FAQs on the exercise Evaluating Leaves

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

1 Like

Can minimizing player win the game?
As far as I can tell:
maximizing player - picks the move with the highest value (to win).
minimizing player - never wins but minimizes his loss (that is, picks a move that leads to a tie).

But in the interactive picture of the lesson, minimizing player can win! I’m confused :frowning:

1 Like

Whoever wrote this exercise doesn’t understand tic-tac-toe. If “you have three possible moves”, then there will be two more moves after your current play. There’s no check-mate, this isn’t chess.