最强大脑魔方墙挑战！Python代码实现

关于魔方墙是什么，随便扒拉了一个介绍：
【解密最强大脑】魔方找茬是怎样做到的？
这个问题感觉比较有趣，自己写了个魔方墙代码用来玩

import matplotlib.pyplot as plt
import numpy as np

def generate_mfq(n,m,colors,change_time):
    # 创建一个数组来保存颜色数据
    color_grid = np.random.choice(colors, size=(n, m))

    # 随机生成一个魔方墙
    color_map = np.zeros((n, m, 3))
    for i in range(n):
        for j in range(m):
            color_map[i, j] = color_dict[color_grid[i, j]]
    
    # 随机变动change_time个像素
    color_map_modify = color_map.copy()
    for t in range(change_time):
        i = np.random.randint(n)
        j = np.random.randint(m)
        
        # 随机换一个和当前不同的颜色
        current_color = color_grid[i, j]
        new_color = np.random.choice([color for color in colors if color != current_color])
        print(f"==== change {t}: pixel {i},{j} from ({current_color}) to ({new_color}) ====")
        
        # 更新
        color_grid[i, j] = new_color
        color_map_modify[i, j] = color_dict[new_color]
        
    fig, axs = plt.subplots(1, 2, figsize=(12, 6))
    axs[0].imshow(color_map)
    axs[1].imshow(color_map_modify)

    plt.savefig('color_maps.png', dpi=300, bbox_inches='tight')
    plt.show()
    
    return color_map, color_map_modify

n = 100  # 魔方墙行数
m = 100  # 魔方墙列数
change_time = 3  # 变动的像素个数
colors = ['red', 'blue', 'yellow', 'green', 'white']
color_dict = {
    'red': [1, 0, 0],
    'blue': [0, 0, 1],
    'yellow': [1, 1, 0],
    'green': [0, 1, 0],
    'white': [1, 1, 1]
}

color_map, color_map_modify = generate_mfq(n,m,colors,change_time)

代码运行了会输出变动的格子和颜色【注意下标是从0开始噢】

==== change 0: pixel 4,3 from (red) to (yellow) ====
==== change 1: pixel 83,57 from (yellow) to (green) ====
==== change 2: pixel 52,13 from (blue) to (red) ====