After seeing Kev release a multiple choice pattern-matcher (Needle) I realised that Waylander's throne might be under threat. I immediately got to work on shrinking Waylander, and ended up at a fully functional 586 bytes, albeit with the matching switched from velocity-deltaheading to LateralVelocity-AdvancingVelocity. With almost 200 bytes to play with it was fairly simple to add in finding more than one match, and then multiple-choice. I even added a few things that I don't believe Needle has, such as making sure that you never find the same match twice ( it seems it does....oh well ;-) ).
We'll see ;-)
Actually, Needle also makes sure to never use the same match twice. But one thing interesting I tried when making Needle was deliberately using the longer matches multiple times to give them a higher weight. Anyway, good luck with multiple choice pattern matching. Hopefully it will give us the edge to break 2K =). -- Kev
Cool, how did you implement it? Just make sure that you search from later than your current match? I keep an array of all the indexes I've rebuilt matches from so I don't get the same one twice, and each time I decrease the match-length I start searching from the beginning again. I also weight the longer matches higher, by incrementing the bins by the match length instead of just 1. And that 2K barrier has been standing much too long! Although I suspect not much longer ;-) Starting up 2 clients now that my home internet is back up and running! -- Skilgannon