Use of simulated annealing to find the maximum number of flips needed in a high “n” of the “Pancake Problem”

Project title: Use of simulated annealing to find the maximum number of flips needed in a high “n” of the “Pancake Problem”
Overview:

This project aims to find an approximation of the global optimum of the “Pancake Problem” using the process of simulated annealing.