Convert Movelist into Priority Queue

[zborffs]

• Write a new file in the benchmark folder that compares the speeds of sorting random list of ints and inserting those random ints into into a priority queue then popping or then sorting then inspecting... Let this inform a hypothesis.
• Collect performance metrics for current methodology (insert and sort)
  • from 300+ test suite positions, collect avg. depth reached, number of nodes searched, move ordering %
• Alter the movelist object to have the priority queue adapter, then do .push() (or whatever the syntax is) to make it a priority queue. Call "order_moves" somehow from the move_gen function, so every move is assigned a complete score before being added to the queue, then when leaving the move_gen function, just call top() or sort() or whatever.
  • from 300+ test suite positions, collect avg. depth reached, number of nodes searched, and move ordering %