This paper develops a novel particle swarm optimiser algorithm. The focus of this study is how to improve the performance of the classical particle swarm optimisation approach, i.e., how to enhance its convergence speed and capacity to solve complex problems while reducing the computational load. The proposed approach is based on an improvement of Particle Swarm Optimisation using Evolutionary Game Theory. This method maintains the capability of the particle swarm optimiser to diversify the particles' exploration in the solution space. Moreover, the proposed approach provides an important ability to the optimisation algorithm, that is adaptation of the search direction which improves the quality of the particles based on their experience. The proposed algorithm is tested on a representative set of continuous benchmark optimisation problems and compared with some other classical optimisation approaches. Based on the test results of each benchmark problem, its performance is analysed and discussed.