Shortest path finding has been one of the most important research areas in gaming for several years. Path finding is computer games is a major problem that many video games are facing. Many search algorithms are present to solve the shortest path problem such as Djkstra's algorithm, Iterative Deepening Depth First Search algorithm and Breadth First Search algorithm. A* algorithm as a provably best possible way out for path finding. In the beginning slice, outline of path finding is presented. Then the information of A* algorithm are addressed as a base of giving a number of optimization techniques from different angles. At last, a number of examples of how the path finding techniques are used in games and a conclusion are drawn