Pseudo code of solve of Hidato

solve.py

def solve(table, step, limit):
    if step == limit + 1:
        return [table]
    else:
        return [
            item
            for new_table in step_matrix(table, step)
            for item in solve(new_table, step + 1, limit)
        ]

def step_matrix(table, step):
    if cell_in_table(step, table):
        if get_cell_value(get_cell(table, step)) == 1 or is_adyacents(get_cell(table, step), get_cell(table, step - 1)):
            return [table]
        else:
            return []
    else:
        return [
            update_cell_in_table(table, update_value_in_cell(step, cell))
            for cell in get_adyacents(table, get_cell(table, step - 1))
            if get_cell_value(cell) == 0
        ]