In Tunguska I've been "cheating" and using the native system to calculate most arithmetic operations.
So, to calculate %1A0 + %002, for an instance, I would convert the two numbers to binary (72 and 2), compute the result with C++'s + operator, and then convert back to ternary.
The ternary->binary conversion is very quick, but the binary->ternary algorithm is quite bulky. So I'm wondering if there are any established algorithms for ternary arithmetics (mainly addition, multiplication, division, and modulo)
Of course, I could probably get to it and make my own algorithms, but that feels an awful lot like re-inventing the wheel.
02 Mar 2008 10:01
Joined: 09 Jan 2003 02:22 Posts: 15297 Location: New York
Users browsing this forum: No registered users and 4 guests
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot post attachments in this forum