如何应用暴力方法来解决传教士和食人族的问题？

def is_valid(state):
    # 判断状态是否合法
    if state[0] < state[1] and state[0] > 0:
        return False
    if state[3] < state[4] and state[3] > 0:
        return False
    return True

def dfs(state, visited, path):
    # 深度优先搜索
    if state == [0, 0, 0, 3, 3, 1]:
        # 找到目标状态，输出路径
        for s in path:
            print(s)
        print(state)
        return True
    
    visited.append(state)
    
    for i in range(3):
        for j in range(3):
            if state[2] == 1:
                # 传教士在左岸
                new_state = [state[0]-i, state[1]-j, 0, state[3]+i, state[4]+j, 1]
            else:
                # 传教士在右岸
                new_state = [state[0]+i, state[1]+j, 1, state[3]-i, state[4]-j, 0]
            
            if is_valid(new_state) and new_state not in visited:
                path.append(state)
                if dfs(new_state, visited, path):
                    return True
                path.pop()
    
    visited.remove(state)
    return False

# 初始状态
initial_state = [3, 3, 1, 0, 0, 0]
# 已访问状态列表
visited = []
# 路径列表
path = []

# 深度优先搜索
dfs(initial_state, visited, path)