Move Sort

[jordanbray]

I need to implement a move sorter for chess engine developers.
This will need to take in a PV, a list of killer moves, a function to sort captures and a fuction to sort quiet moves.
It will need to iterate in the following order:

• PV (iff PV is legal, passed in by user)
• Good Captures (sorted by user supplied function, determined good capture by same function)
• Killers (iff legal, passed in by user)
  ** Remove all killers from move list!
• Good Quiets (sorted by user supplied function, determined good by user supplied function)
• Bad Moves

It needs the ability to stop at an arbitrary point (Such as only iterating over captures for qsearch).

[ArcticXWolf]

Heyho,

as I am currently developing a chess engine with your crate (Thanks for the awesome work!), I would love to try and implement this. I am sure that my first draft wont be performant or efficient, but maybe you can review this and then we improve it from there?

Is that okay for you? And hints / stuff that I should be aware during implementation?