Sliding Puzzle In PHP: Solving With BFS
BFS algorithm used to find shortest path to solve 2x3 sliding puzzle board with minimum moves.
773. Sliding Puzzle Difficulty: Hard Topics: Array, Breadth-First Search, Matrix On an 2 x 3 board, there are five tiles labeled from 1 to 5, and an empty square represented by 0. A move consists of choosing 0 and a 4-directionally adjacent number and swapping it. The state of the board is solved if and only if the board is [[1,2,3],[4,5,0]]. Given the puzzle board board, return the least number of moves required so that the state of the board is solved. If it is impossible for the state of the board to be solved, return -1. Example 1: Input: board = [[1,2,3],[4,0,5]] Output: 1 Explanation:...