nonogram/efficiency.py at master · umcodigo/nonogram · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
from datetime import datetime
import random

from lib import *


if __name__ == '__main__':
    start = datetime.now()


    MAX_BOARD = 6 # 5*5
    MAX_ITER = 5

    for odds in range(2, 5):
        print('Odds', odds)

        for m in range(1, MAX_BOARD):
            n = 5*m
            good = 0
            bad = 0

            for i in range(MAX_ITER):
                # print('---')

                grid = []
                while not valid_grid(grid):
                    grid = create_easy_grid(n, odds)
                    # grid = create_grid(n)

                # print_grid(grid)

                lines = get_counts(grid)
                cols = get_counts(transpose_grid(grid))

                try:
                    grid, count = solve_grid(n, lines, cols)
                    # print_grid(grid)
                    # print('Tabela convergiu em {} iterações!'.format(count))
                    good += 1

                except:
                    # print('Tabela não convergiu')
                    bad += 1

            # print('good', good)
            # print('bad', bad)

            print('  Tamanho', n, 100*good/(good+bad), '%')

    end = datetime.now()
    print(end-start)