Calculator Community > Axe

Shifting Order

(1/4) > >>

Raylin:
Say that 7 players have a number (1-7).
Say there is a list that is populated with these numbers (1-7).
The concept here is to establish some sort of order here.

i.e. When Player 1 moves, he moves to the bottom of the list and works his way up the list. Every other player follows suit.

EDIT: The list looks like this.


--- Code: ---1
2
3
4
5
6
7
--- End code ---

*Player 1 ends his turn

The list should look like this.


--- Code: ---2
3
4
5
6
7
1
--- End code ---

_player1537:

--- Code: ---Repeat Getkey(15)
(player does turn here)
{L1}->A
For(B,1,6
{L1+B}->{L1+B-1
End
A->{L1+6
End

--- End code ---

Raylin:
Thank you, good sir.

cooliojazz:
wouldn't seq(L1(X),X,2,7)->L1 be faster than the for loop?

JonimusPrime:

--- Quote from: cooliojazz on April 11, 2010, 09:11:00 pm ---wouldn't seq(L1(X),X,2,7)->L1 be faster than the for loop?

--- End quote ---
Except this is in the axe parser subforum and I'm not sure if axe has a sequence command. Other wise yes that would be the better solution.

Navigation

[0] Message Index

[#] Next page