To the Moon, in-game memento solver

memento_solver.py

import itertools

def solve_memento():
    rowNum = int(input('Row number: '))
    colNum = int(input('Col number: '))
    best = int(input('Best move: '))
    print("Input table, 1 for solved, 0 for unsolved")
    table = [list(map(lambda x: True if int(x) == 1 else False, input().split())) for i in range(rowNum)]

    def check():
        return all([all(row) for row in table])

    def flip(i, j):
        table[i][j] = False if table[i][j] else True

    def apply_solution(solution):
        for r in range(rowNum):
            if solution[r]:
                for c in range(colNum):
                    flip(r, c)
        for c in range(colNum):
            if solution[rowNum+c]:
                for r in range(rowNum):
                    flip(r, c)
        if solution[-1]:
            # diagnol, from left-bottom
            for i in range(min(rowNum, colNum)):
                flip(rowNum-1-i, i)

    def print_solution(solution):
        for r in range(rowNum):
            if solution[r]:
                print('r%s' % r)
        for c in range(colNum):
            if solution[rowNum+c]:
                print('c%s' % c)
        if solution[-1]:
            print('d')

    for solution in itertools.product([False, True], repeat=rowNum+colNum+1):
        if solution.count(True) > best:
            continue
        apply_solution(solution)
        if check():
            print_solution(solution)
            break
        else:
            apply_solution(solution)
    else:
        print('No answer for best move %s' % best)


solve_memento()