I tried to use the QAOA to solve the MaxCut problem on a 10 nodes weighted graph and run the simulation on qiskit from $p = 1$ to $p = 6$. I was expecting to get closer to the real solution as $p$ grew but I got the opposite. I reached the solution at $p = 3$ and then it started to drift away. Why did it happen?
If the angles that were selected are not good enough, you could get worse approximation ratios as p increases. Assuming that you do not have optimal angles for each round p, what angle finding strategy did you use? Increasing the amount of computation for the angle finding could make your results better.