lol i cant find the str1 key is this one made on the TI - 84 / 83 ti 89 has diff programing
pjgat09 <[EMAIL PROTECTED]> wrote: --- In [email protected], "undermostfiend" <[EMAIL PROTECTED]> wrote: > > can anyone help me make a scrambling program for the TI - 83. > > Thanks > > John, > Hi John, I made one in about 5 min, then sized it down. Heres the simple program. Note, it asks for input at start. This is the number of moves of the scramble. This program also blocks any cases like F B F or R L R. Hope you like it. Dont change any of the program, it works perfectly as is. (yes, that includes the missing parentheses and quotation marks) Note: to access the scramble after the program runs: Vars-String-Str1 Here you go: 1->Y " ->Str1 DelVar ADelVar B Input Z Lbl A randInt(1,6->C If C=A Goto A If C=B Goto A A->B C->A If C=1 Str1+" F->Str1 If C=2 Str1+" B->Str1 If C=3 Str1+" L->Str1 If C=4 Str1+" R->Str1 If C=5 Str1+" D->Str1 If C=6 Str1+" U->Str1 randInt(1,3->C If C=2 Str1+"2->Str1 If C=3 Str1+"3->Str1 Y+1->Y If Y=Z Stop Goto A Feel free to change it as much as you want, but credit me. :) Also tell me if you make it any shorter. Heres a quick programming description of the program: First, reset the counter to 1 (Y). Input your scramble number, then start the loop (loop A). Generate a random number C. Heres where I shortened the program quite a bit. Instead of looking for cases like FBF it will also cancel FLF or FUF. This is done with A and B. A is our immediate past, and B is our distant past. If C = A, make a new number (if FF or RR etc happens, make a new letter). If C = B make a new number (if FBF or FUF or FLF etc happens, make a new letter). After you pass those checks, it changes the past into the distant past and the new letter to the past (past to distant past: A->B new to past: C->A). Now we create a rotation. Using the same variable C, make a new number 1-3. Notice that 1 is never used. That is because 1 rotation can be shown as nothing, so no check is needed. :) After it adds rotation, 1 is added to the counter which is checked against your input. If they match, the program ends. Remember, the scramble is stored in Str1 (Vars-String-Str1). I chose not to display the scramble at the end because you wouldn't be able to see it. The program would end blocking you from scrolling through the scramble. Thats why you must pull it up manually. Well, enjoy my program. Hope it brings much school time (or work time) cubing. Peter Greenwood --------------------------------- YAHOO! GROUPS LINKS Visit your group "speedsolvingrubikscube" on the web. To unsubscribe from this group, send an email to: [EMAIL PROTECTED] Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service. --------------------------------- --------------------------------- What are the most popular cars? Find out at Yahoo! Autos [Non-text portions of this message have been removed] Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/speedsolvingrubikscube/ <*> To unsubscribe from this group, send an email to: [EMAIL PROTECTED] <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/
