| |
BGonline.org Forums
Trad to Nactation conversion algorithm
Posted By: Matt Ryder In Response To: Trad to Nactation conversion algorithm (Nack Ballard)
Date: Thursday, 10 February 2011, at 1:11 a.m.
> means enter both/all checkers.
Isn't this indistinguishable from U?
[Btw, the position that Tim originally posted, testing the limits of Nactation, is different from Zare's most-legal-play position posted by Ian later (which you just linked); not that it matters.]
Tim referenced this position in the recent Nactation + XG thread as a reason why a trad to nactation conversion algorithm couldn't be written because "nactation (in its currently published form) isn't developed enough yet to handle such cases."
I agree with him that there currently appear to be a paucity of characters to cover a possible 2226 legal variations. Perhaps if the families were extended with a palette of colours (as you suggested in the original limits of nactation thread), this might conceivably be addressed.
Such "extreme" situations make excellent test cases for an algorithm because they explore the boundaries of what the algorithm can do. But on a pragmatic level, so long as the algorithm can handle 99% of real-world scenarios in a reasonable time-frame, I'd be satisfied (after all, nactation isn't replacing trad, just supplementing it).
Matt R.
| |
BGonline.org Forums is maintained by Stick with WebBBS 5.12.