A new approach to path-finding by possibilities search

This paper presents a new approach to the path-finding in video games. Path-finding algorithms, are used to find a path between two positions of a map. The standard way consists to search for a specific path. However it appears that in actual games, where the allowed computation time becomes smaller and the game-plays and maps are more complex, it should not be the best way to proceed. Therefore, this new approach to the path-finding considers the global possibilities of movement instead of searching for a specific path. This paper describes the concept of possibility and details the procedure used to search them. The appreciable experiments results prove the validity and efficiency of this approach.