Search⌘ K
AI Features

Open the Lock

Explore how to apply Tree Breadth-First Search to solve the Open the Lock problem. Learn to calculate the minimum moves to reach a target combination on a 4-wheel lock while avoiding blocked positions. This lesson helps you grasp cyclic wheel rotations, deadend constraints, and strategic traversal to find the shortest path efficiently.

Statement

You are given a lock with 44 circular wheels, each containing digits '0' through '9'.

  • The wheels can rotate freely and wrap around cyclically; turning '9' forward leads to '0', and turning '0’ backward leads to '9'.

  • Each move consists of rotating one wheel by one position (either forward or backward). ...