コード例 #1
0
ファイル: Robot.py プロジェクト: pedramnoori/Classical-Search
    def huristic(self, state):
        cost = 0

        cost = (state.row - state.value[0]) + (state.col - state.value[1])

        return cost


print("DFS : \n")
C = Problem()
Alg7 = Algorithms(C)
Alg7.DFS(C.initialState())
print("=========================")

print("UCS : \n")
B = Problem()
Alg6 = Algorithms(B)
Alg6.UCS(B.initialState())
print("=========================")

# print("BIDIRECTIONAL : \n")
# D = Problem()
# Alg8 = Algorithms(D)
# Alg8.bidirectional(D.initialState(), D.initializeGoal())
# print("=========================")

print("A_STAR : \n")
E = Problem()
Alg9 = Algorithms(E)
Alg9.A_star(E.initialState())
print("=========================")
コード例 #2
0
        return state



P = Problem()
Alg = Algorithms(P)
print("DFS : \n")
Alg.DFS(P.initialState())
print("=======================")

#
D = Problem()
Alg2 = Algorithms(D)
print("UCS : \n")
Alg2.UCS(D.initialState())
print("=======================")

#
C = Problem()
Alg3 = Algorithms(C)
print("BIDIRECTIONAL : \n")
Alg3.bidirectional(C.initialState(), C.initializeGoal())
#
print("=======================")

A = Problem()
Alg4 = Algorithms(A)
print("A_STAR : \n")
Alg4.A_star(A.initialState())