I've developed an extensive test framework for comparing both how fast and how well algorithms perform using a simulated matching circuit. I've commented the code for my newest algorithm to some extent. It's actually fairly straightforward except for the derivations of the WAGs (wild a$$ guesses). You can see it and the framework at?
The algorithm in the extensive article from k6jca you mentioned is not much different than my last iteration (the one posted on the group previously).
