Identifying Best Goalkeepers Problem is a NP-Hard?

Computational problems are categorized as solvable, partially solvable and unsolvable. Classes including P, NP, NP-complete and NP-Hard are used to classify the given problem based on the complexity of the problem. Recently many problems have been proven to be NP-Hard in the domain of various sports, especially football game. Apparently, we have found that identifying best goalkeepers’ problem has been overlooked. In this problem, “Identifying best goalkeepers” from a set of players is difficult and challenging. Authors have mapped this problem with partitioning problem with respect to Graph Theory. Finally, mathematical formulation has been demonstrated for the NP-Hard problem.