本文整理汇总了Python中problem.Problem.pathCost方法的典型用法代码示例。如果您正苦于以下问题：Python Problem.pathCost方法的具体用法？Python Problem.pathCost怎么用？Python Problem.pathCost使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类problem.Problem的用法示例。
在下文中一共展示了Problem.pathCost方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: greedyBFSBattle
# 需要导入模块: from problem import Problem [as 别名]
# 或者: from problem.Problem import pathCost [as 别名]
def greedyBFSBattle(self, currentState, player):
problemObj = Problem(currentState, self.boardValue, player)
possibleStates = problemObj.possibleStates(currentState, player)
stateCost = []
for state in possibleStates:
stateCost.append(problemObj.pathCost(state))
nextState = possibleStates[stateCost.index(max(stateCost))]
return nextState示例2: greedyBFS
# 需要导入模块: from problem import Problem [as 别名]
# 或者: from problem.Problem import pathCost [as 别名]
def greedyBFS(self):
problemObj = Problem(self.initialState, self.boardValue, self.player)
possibleStates = problemObj.possibleStates(self.initialState, self.player)
stateCost = []
for state in possibleStates:
stateCost.append(problemObj.pathCost(state))
nextState = possibleStates[stateCost.index(max(stateCost))]
# self.printState(nextState)
self.outputState(nextState) # save output to a file.