Talk:Symbolic Pattern Matching
|
- [View source↑]
- [History↑]
You cannot post new threads to this discussion page because it has been protected from new threads, or you do not currently have permission to edit.
Contents
Thread title | Replies | Last modified |
---|---|---|
How to Improve a Pattern Matcher | 6 | 05:15, 25 July 2019 |
Hi, what are some easy ways to improve the standard nano-sized pattern matcher? I've tried everything (that I can think of!) but each change just seems to make the gun worse. Thanks!
Think this way: if there are easy ways to improve, it should be already within every nano-sized pattern matcher.
And, most changes are making things worse simply means you may be already at some local minimum, which is discovered by the predecessors. The "improvements" you easily think of may be already tried by predecessors as well, and the ones that work are already applied.
So, to push the bar further, just go the "hard" way. Record some data of every opponent you need to face, encode some behavior of your gun into genes, and use genetic algorithms to find a way out!
Ah, I was hoping there were some simple ways that took a bit more codesize. Since the nano-sized pattern matcher I am using is not in a NanoBot, I can afford better performance for more code. I have quite a few bytes to spare in Basilite and I was hoping for changes that were easy to put in and gave small gains, like energy management for example.
Multiple choice is the obvious improvement if you have more codesize. Otherwise adding distance buckets can also be helpful. Cotillion does both of these.