1from collections import deque
2
3def sliding_puzzle(board):
4    start = ''.join(str(num) for row in board for num in row)
5    target = '123450'
6    neighbors = {
7        0: [1, 3],
8        1: [0, 2, 4],
9        2: [1, 5],
10        3: [0, 4],
11        4: [3, 1, 5],
12        5: [2, 4]
13    }
14    queue = deque([(start, start.index('0'), 0)]) # (board_str, zero_index, depth)
15    visited = {start}
16    while queue:
17        board_str, zero_index, depth = queue.popleft()
18        if board_str == target:
19            return depth
20        for adj in neighbors[zero_index]:
21            new_board = list(board_str)
22            new_board[zero_index], new_board[adj] = new_board[adj], new_board[zero_index]
23            new_board_str = ''.join(new_board)
24            if new_board_str not in visited:
25                visited.add(new_board_str)
26                queue.append((new_board_str, adj, depth + 1))
27    return -1

1import java.util.*;
2
3