Search-Algorithms-IA/beam_search.py at master · Muriloide21/Search-Algorithms-IA · 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
53
54
55
56
57
58
59
60
61
62
63
64
from hill_climbing import *

TIPOS = [ (1,3), (4,6), (5,7) ]

def beam_search(types, max_size, m):
    f = []
    state = [0 for i in types]
    newStates = expandState(state)

    validStates = list(
        filter(
            lambda state: stateIsValid(state, types, max_size),
            newStates,
        )
    )

    validStates.sort(key=lambda x: stateValue(x, types))
    #print(validStates)

    for i in range(0,m):
        f.append(validStates.pop())
        if len(validStates) == 0:
            break

    #print(f)

    while True:
        aux = []

        for i in range(0, len(f)):
            validStates = []
            newStates = expandState(f[i])

            validStates = list(
                filter(
                    lambda state: stateIsValid(state, types, max_size),
                    newStates,
                )
            )

            aux += validStates

        if not aux:
            return f.pop(0)

        aux.sort(key=lambda x: stateValue(x, types))
        #print(aux)

        f = []
        for i in range(0,m):
            f.append(aux.pop())
            if len(aux) == 0:
                break

        #print(f)

if __name__ == "__main__":
    result = beam_search(TIPOS, 19, 2)
    print(result)
    print("Custo da solução: "+str(stateSize(result, TIPOS))+", Valor da solução: "+str(stateValue(result, TIPOS)))