Re: ZAD Adventure System - Progress
Posted: Mon Feb 19, 2018 10:52 am
Its better to think of it as a matrix or even better a topology. When you can abstract it in that way you can start to look for solutions from a wide number of sources. It then becomes a question of if the maths solution can be implemented effectively in 8-bits.
You already are in a good place, you have a known size to the data you are trying to represent (the size of the dictionary is bound by your implementation. - its got to fit into memory even if you are using a tokenizer.) If its a fixed, complete continuous series of values that are bound within a finite range then that sounds to me a lot like a ring. Ring theory is beautiful - there is lots of deep theory to it and its been extensively studied. Again the maths is not complicated - its only a little bit more difficult than set theory.
The big advantage to using commutative algebra (ring theory) is its already a pretty good fit for computer science. its dependent on binary. and commutative algebra is the gateway drug to abstract algebra.
With computer science/programming you already know binary, you will have a intuitive understanding how how this stuff works with a little work.
The problem is you are looking for implementation specific solutions already when there is a world of rich solutions waiting to be considered. Matrix algebra is not all that hard either its just a dry subject. I'd bet 20p that there are some slick techniques just sitting gathering dust in some journal/monograph somewhere that would solve ya problem.
You already are in a good place, you have a known size to the data you are trying to represent (the size of the dictionary is bound by your implementation. - its got to fit into memory even if you are using a tokenizer.) If its a fixed, complete continuous series of values that are bound within a finite range then that sounds to me a lot like a ring. Ring theory is beautiful - there is lots of deep theory to it and its been extensively studied. Again the maths is not complicated - its only a little bit more difficult than set theory.
The big advantage to using commutative algebra (ring theory) is its already a pretty good fit for computer science. its dependent on binary. and commutative algebra is the gateway drug to abstract algebra.
With computer science/programming you already know binary, you will have a intuitive understanding how how this stuff works with a little work.
The problem is you are looking for implementation specific solutions already when there is a world of rich solutions waiting to be considered. Matrix algebra is not all that hard either its just a dry subject. I'd bet 20p that there are some slick techniques just sitting gathering dust in some journal/monograph somewhere that would solve ya problem.