FAQ: Minimax - Detecting Tic-Tac-Toe Leaves

This community-built FAQ covers the “Detecting Tic-Tac-Toe 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 Detecting Tic-Tac-Toe 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!

Another example of terrible directions.

At the bottom of script.py , create a function called game_is_over() that takes a board as a parameter. The function should return True if the game is over and False otherwise.

But this isn’t what the solution addresses, it wants to know if a specific player has won. Please don’t set your users up for failure. It’s frustrating.

1 Like

Hi, I had a similar view while trying to figure out the solutions. But in the moment of writing a similar query, realized that there can be a scenario where player x has won but there are still moves left, in that case just having the available_moves condition wont be correct.
Imagine this: X and O are marked alternatively by 2 players. Using a classic trick, x marks the 3 corners of the grid resulting in 2 cases, one of them for sure results in player X winning. There are still moves left but the game is over
[“X”, “2”, “O”],

[“O”, “O”, “6”],

[“X”, “X”, “X”]

Hope this helps :smiley:

1 Like