User blog comment:PsiCubed2/My own version of BMS/@comment-35470197-20181120231600/@comment-30754445-20181121141930

Patience, my friend.

This version only popped into my head on the same day I've written this blog post. The other version is far more complicated, and proving the equivalence of the two is not at all obvious.

And the virtue of this version is its simplicity. Unlike all the other versions of BMS (except BM1) it has a very elegant and very simple set of rules that anyone can follow. You won't need any computer program to analyze this baby. It is an exercise in simplicity, which is what made the original BMS so attractive.

And I certainly plan to eventually prove (or disprove) that my version actually works up to (0,0,0)(1,1,1). It's just going to take some time (a lot of time, probably). And in the mean time, you can help out by telling me whether you think the rule-set I've given actually works or not. Should I put my effort into trying to prove that it works, or into searching for a counter example?

(My version is probably hopelessly broken for general triads, because I've made absolutely no effort on that front. Then again, I would be willing to wager real money that none of the existing version of BMS actually work at that level, so I don't lose sleep over it)