Quick Summary
- Transform a 1D board of red, black, and empty tiles into a target configuration using valid slide and jump moves.
- Red tiles move right, black tiles move left, with strict rules on sliding into adjacent empties or jumping over exactly one opposite color.
- Find the shortest sequence of board states connecting start to end, returning an empty list if unreachable.
What This Tests
- State-space exploration and graph modeling
- Shortest-path search in unweighted graphs
- Path reconstruction via parent tracking
- Pre-search invariant validation
Common Patterns
Breadth-First Search (BFS)
State Space Exploration
Graph Traversal
Path Reconstruction
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Test Cases
Input
Output
Expected