八数码问题代码matlab

以下是一个简单的八数码问题的解决代码示例，使用了广度优先搜索（BFS）算法：

%% 八数码问题解决代码

% 初始状态
start_state = [2, 8, 3; 1, 6, 4; 7, 0, 5];

% 目标状态
goal_state = [1, 2, 3; 8, 0, 4; 7, 6, 5];

% 方向定义
directions = [-1, 0; 1, 0; 0, -1; 0, 1];

% 记录状态和对应的前驱状态
state_history = containers.Map('KeyType', 'char', 'ValueType', 'char');

% 广度优先搜索
queue = Queue();
queue.push(start_state);
state_history(mat2str(start_state)) = mat2str(start_state);

while ~queue.isempty()
    current_state = queue.pop();
    
    if isequal(current_state, goal_state)
        break;
    end
    
    % 找到空白格的位置
    [empty_row, empty_col] = find(current_state == 0);
    
    % 移动数字
    for d = 1:size(directions, 1)
        new_row = empty_row + directions(d, 1);
        new_col = empty_col + directions(d, 2);
        
        if new_row >= 1 && new_row <= size(current_state, 1) && ...
                new_col >= 1 && new_col <= size(current_state, 2)
            % 交换空白格和相邻数字的位置
            new_state = current_state;
            new_state(empty_row, empty_col) = current_state(new_row, new_col);
            new_state(new_row, new_col) = 0;
            
            % 检查新状态是否已经访问过
            if ~state_history.isKey(mat2str(new_state))
                queue.push(new_state);
                state_history(mat2str(new_state)) = mat2str(current_state);
            end
        end
    end
end

% 回溯路径
path = [];
current = mat2str(goal_state);

while ~isequal(current, mat2str(start_state))
    path = [path; str2num(current)];
    current = state_history(current);
end

% 倒序输出路径
path = flipud(path);
disp("路径: ");
disp(start_state);
for i = 1:size(path, 1)
    disp("↓");
    disp(path(i, :));
end

请注意，这只是一个简单的示例，可能不是最优的解决方案。你可以根据自己的需求进行修改和优化。