Nowadays, computer games, including games on a mobile device, represents itself as an important part in the daily lives of a portion of society that have interest in games—ranging from young children to older adults. However, the majority of these people play without knowledge of the complexity of these games. This fact incepted the idea to analyze three popular endless running games which were: Minion Rush, Subway Surfer, and Temple Run 2 using graph theory. As a result of using the analysis results, the portion of society with gaming interests can identify which endless running games are complex, easy or difficult, and unique. The first action accomplished was data gathering by playing the three specified games. Afterward, the obtained data was converted into a matrix. This matrix was then processed into a number of trap, dead, and dead trap. The matrix results were then converted into a graph using graph theory. Results from data processing allow the conclusions of several things. First of all, the analysis results obtained from 90 gathered data are the comparisons of the dead factor, the number of exit traps, number of heading traps, number of lines, and the dead trap. Secondly, with 4.1 Temple Run 2 is the most difficult game of the three. Third, the game with the highest level of complexity is Subway Surfer with a complexity of 93%. Lastly, with 3.03 the most unique game is Temple Run 2