>>323769273
Test went reasonably well. I think the main problem is the performance of the udon code now, which is at least pretty ripe for optimization. If anyone's curious the code is at https://github.com/hiinaspace/maximal-matching . 

The other known issue is that the matching behavior is non-optimal in some cases. I'm hoping I'll have time to implement https://en.wikipedia.org/wiki/Blossom_algorithm . we'll see.