Announcing the "Dare 2 Compare", new version of the Total_Rekall

[Ángel Martin]

(09-06-2016 06:46 AM)Didier Lachieze Wrote:  

(09-06-2016 05:23 AM)Ángel Martin Wrote:  A quick look at the 34 QRG helped me understand your comment - so it's a general-purpose stack arrangement alteration, which corresponds to some standard functions in particular cases but goes beyond that of course. I reckon it should be relatively simple to implement this using ALPHA to hold the "master" string of the stack arrangement, such as "YYZZ"... an interesting exercise but how about practical applications for it?

Yes, it's a general command to generate any possible stack arrangement, it's very useful if the implementation make it shorter and quicker than the equivalent sequence of traditional stack commands to achieve the same goal. It is useful especially in long loops where any execution time saved has a significant impact on the overall program duration.

If you use the Alpha register to hold the master string this will not save any time nor decrease the overall instruction count. With 4 registers to track you can code them with two bits and code the string with a byte, so my idea was, if possible, to have a new <> instruction which would accept the 4 letters X, Y, Z, T as parameters to generate the byte coding the stack final state. But this is may be pushing the envelope too far ...

In manual mode the prompts will work just fine, but then in a running program you need that information to be stored somewhere - either in ALPHA or in a non-merged parameter in the next program step. This is going to contribute to the byte count... You're right four stack registers can fit in two bytes, which also frees Alpha and thus can be included in the prompt choices - in fact, I'm leaning towards a five-prompt scheme to also include LastX, and allow M-P in the inputs...

SHFL: _ _ _ _ _

neat stuff, let's see how far we can take it .