Path finding

path finding uses algorithms

A* Algorithms always tries to find the best routes within the maze. it is built into most gaming engines.




Dijkstra Algorithm always finds the quickest route to be able to find the best route out of a maze or any type of game (to be able to find items the quickest/ get to point B from A). it is used also within maps/ satnavs.


for example the starting point is A and the end goal is G it will look through every type of possibilty to get to G to see whats the quickest route


Markov Decision Process

Markov Decision Process is a decision making process where in situations the outcomes are completely random and is down to the input decision of the user. the MDP is a rule to be able to make dissensions within certain outcomes for example going towards the door could lead to more loot but also more AI but however going to the left route is longer and safer but less loot to acquire.

Comments

Popular posts from this blog

Learning Techniques

Decision making concepts

Algorithms, heuristic and hacks