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

Post a Comment

Popular posts from this blog

Hardware Constraints

Image
Hardware Constraints  Hardware Constraints determine the fact that certain games can run on certain devices because certain games maybe more demanding on hardware so it can't be run on other devices. For example Destiny 2 can be run on the PS4, Xbox one and also the PC but can't be run on the Nintendo switch or mobile phone as it requires more hardware than what them consoles can provide so they will not be able to get the game on the devices. it's also like Crash Bandicoot N. Sane Trilogy its PC, PS4, XBOX one and Nintendo switch but its not on mobile phones, Ds or PSP because of hardware constraints. To be able to get a better player experience you will need to make sure its on multiple consoles for different player needs (on the go/ static players) but also make it have good graphics to make the user want to keep coming back to be able to play the game. but also by not dimming it down so much that no one will want to play it but spread it throughout everyon...
Read more