AI & Machine Learning Search & Problem Solving Quiz

Before machine learning took over, much of AI was about searching for a solution. This quiz tests the core ideas behind state spaces, breadth-first and depth-first search, A* with heuristics and minimax for games, at concept level with small examples.

Medium 10 questions ~6 minutes Pass at 80%

Choose a mode

Playing as a guest: sign in to keep your XP and streak.

Sample question

Question 1 of 10

To solve an 8-puzzle (sliding tiles) with search, what is a "state"?

Show the answer

A. One particular arrangement of the tiles on the board A state is a full description of the situation, here a tile arrangement. Moves are actions that lead from one state to another, and the solved board is the goal state.

What this quiz covers

  • States, actions, goals and the search tree
  • Breadth-first vs depth-first search
  • Uniform-cost search and A* with f(n) = g(n) + h(n)
  • Admissible heuristics and why they matter
  • Minimax and alpha-beta pruning in two-player games

Questions people ask

Do I need an account?

No. Anyone can play. Sign in to keep your XP, streak, badges and history.

Can I retake it?

Yes. Your best score is kept, and the questions and answers are shuffled each time.