articifial intelligence , transfrom one word to another NEED TO COMPLETE SUBMISSION.PY, UTIL.PY FOR USE THANKS

Al 4 [-/PycharmProjects/AI 4] .submission.py [Al 4] PyCharm File Edit view Navigate Code Refactar Run Tools Vcs window Help AL4 submission.py submission : q while True Remove the state fron the queue with the Lowest p Problen 3c: Solve the HordTransition Problen Abstract interfaces tar search problens and search algort state, pastCostfrantier.remavelin) if stateone: break sel ?.nunStatesExplored +-1 it selt. verbose >= 2: selt, startkord, goalMord) Return the start state def startstatelself): raise NotImplementedError["Overrit 56 self.startword -startword self.goalwordgoalword print "Exploring s with pastCost \s* {state W Return whether statel is an end state or not def isEnd(selr, state): raise NotImplomentedErrorf Dve50 # Check if ve've reached an end state; if so, extra if prablem.isEndistate: 50 def startStateiselr): BEGIN YOUR CODE lour solution 1s 1 L1ne ot code, raise Exception Not inplenented yet" # END YDUR CDDE # Return a list of ?action, newState, cost) tuples c I # carting out at l state: def succhAndCostiself, state): raise NotInplenentedErro 3 whiLe state-startState: action, prevState backpointers[state] setrac tions , append(action state prevstate self.steps,append (state def ?sEnd(self, state); BEG IN YOUR CODE 'our solution 1s 1 L1ne ot code, bl 12, Class 5earchALqorithn: raise Exception Not inplenented yet" # END YDUR CDDE # First, call solve on the desired SearchProblem lprobli 66 # Then it should set two things: # -self.actions: list of actions that takes one from th 68 self.actions.reversel) self.steps.reverse() state; i?no action sequence exists, 69 Cast pastCost ? BEG IN YOUR CODE lour solution 1s 30 lines ot code. | 22 1t selt.verbose 1: -selt . totalCost: the sun t the costs along the patT 7e action sequence exists raise Exception Not inplenented yet" # END YDUR CDDE print "nunStatesExplored-Sd. % self,n print "totalcost"s self.tatalLast 23 71 det solve(selt, prablen): raise NatInplenentedErrarave 7 rint "actions-es. % self . actions it Len(startword : Uniform cost search algorithn (D1jkstra's algorithm) # Expand from I state! to new successor states # updating the frontier with each newstate 9 lass Unifomcostsearch SearchAlgarithn): ucs util.UniformCostSearch(verbose-8) # BEGIN YOUR CODE {our solution is 4 lines of code, but raise Exception( "Not implenented yet" # END YOUR CODE for action, newState, cost in problen.succAndCost 31 sel ?.verbose-verbose print " Action %s => %s with cost % if frontier.update(newState, pastCost +costl def solve(self, problem) # It a path exists, set lactionsl and Itatalcasti # Found better wy togo ta l new state I, upc backpointers [newState] - (action, state) - Otherwise, leave then as None Selt.totalCost = None it se Lt . verbose >= 1: 38 NordTransition gold'?'aoldb' ) 86 print 'No path found" # Initialize data structures trontier- Priorityqueuel) &Explored states are backpointer?-{} # nap state to {action, previous 91 # Dat structure for supporting uniform cost search class PriorityQueue: (self): Add the start state stariStats problem.startStatei) trontier.update(startstate, selt. DDNE = -1009H self.heap se1f.priorities-{} # Map fron state to priority- # Insert l state into the heap with priority lnewPriority # I state! Isn't in the heapar ine Priar1tyl 1s smaller tha 48 while True: PriorityQueue removeMin) PriorityQueue removeMing Unregistered VCS raat detected: The directary /home/lakshya is under Git, but is not registered in the Settings.' Add root Configure Ignore Itaday 4:78 PM) Al 4 [-/PycharmProjects/AI 4] .submission.py [Al 4] PyCharm File Edit view Navigate Code Refactar Run Tools Vcs window Help AL4 submission.py submission : q while True Remove the state fron the queue with the Lowest p Problen 3c: Solve the HordTransition Problen Abstract interfaces tar search problens and search algort state, pastCostfrantier.remavelin) if stateone: break sel ?.nunStatesExplored +-1 it selt. verbose >= 2: selt, startkord, goalMord) Return the start state def startstatelself): raise NotImplementedError["Overrit 56 self.startword -startword self.goalwordgoalword print "Exploring s with pastCost \s* {state W Return whether statel is an end state or not def isEnd(selr, state): raise NotImplomentedErrorf Dve50 # Check if ve've reached an end state; if so, extra if prablem.isEndistate: 50 def startStateiselr): BEGIN YOUR CODE lour solution 1s 1 L1ne ot code, raise Exception Not inplenented yet" # END YDUR CDDE # Return a list of ?action, newState, cost) tuples c I # carting out at l state: def succhAndCostiself, state): raise NotInplenentedErro 3 whiLe state-startState: action, prevState backpointers[state] setrac tions , append(action state prevstate self.steps,append (state def ?sEnd(self, state); BEG IN YOUR CODE 'our solution 1s 1 L1ne ot code, bl 12, Class 5earchALqorithn: raise Exception Not inplenented yet" # END YDUR CDDE # First, call solve on the desired SearchProblem lprobli 66 # Then it should set two things: # -self.actions: list of actions that takes one from th 68 self.actions.reversel) self.steps.reverse() state; i?no action sequence exists, 69 Cast pastCost ? BEG IN YOUR CODE lour solution 1s 30 lines ot code. | 22 1t selt.verbose 1: -selt . totalCost: the sun t the costs along the patT 7e action sequence exists raise Exception Not inplenented yet" # END YDUR CDDE print "nunStatesExplored-Sd. % self,n print "totalcost"s self.tatalLast 23 71 det solve(selt, prablen): raise NatInplenentedErrarave 7 rint "actions-es. % self . actions it Len(startword : Uniform cost search algorithn (D1jkstra's algorithm) # Expand from I state! to new successor states # updating the frontier with each newstate 9 lass Unifomcostsearch SearchAlgarithn): ucs util.UniformCostSearch(verbose-8) # BEGIN YOUR CODE {our solution is 4 lines of code, but raise Exception( "Not implenented yet" # END YOUR CODE for action, newState, cost in problen.succAndCost 31 sel ?.verbose-verbose print " Action %s => %s with cost % if frontier.update(newState, pastCost +costl def solve(self, problem) # It a path exists, set lactionsl and Itatalcasti # Found better wy togo ta l new state I, upc backpointers [newState] - (action, state) - Otherwise, leave then as None Selt.totalCost = None it se Lt . verbose >= 1: 38 NordTransition gold'?'aoldb' ) 86 print 'No path found" # Initialize data structures trontier- Priorityqueuel) &Explored states are backpointer?-{} # nap state to {action, previous 91 # Dat structure for supporting uniform cost search class PriorityQueue: (self): Add the start state stariStats problem.startStatei) trontier.update(startstate, selt. DDNE = -1009H self.heap se1f.priorities-{} # Map fron state to priority- # Insert l state into the heap with priority lnewPriority # I state! Isn't in the heapar ine Priar1tyl 1s smaller tha 48 while True: PriorityQueue removeMin) PriorityQueue removeMing Unregistered VCS raat detected: The directary /home/lakshya is under Git, but is not registered in the Settings.' Add root Configure Ignore Itaday 4:78 PM)