On Mon, 11 Oct 2010, Sean Hunt wrote:
> On 10/11/2010 01:44 AM, Kerim Aydin wrote:
> >
> > On Mon, 11 Oct 2010, Sean Hunt wrote:
> > > On 10/11/2010 12:34 AM, Kerim Aydin wrote:
> > > > - A player CAN move an indicated player an indicated number of
> > > > positions P on the list in an indicated direction (up or down)
> > > > for a charge equal to the sum of the Influence Levels of all
> > > > the positions between the indicated player's starting and
> > > > ending positions, inclusive.
> > > Makes moves far too difficult. I was going to propose something involving
> > > the
> > > voting difference between them or something. I need to work that out
> > > exactly.
> >
> > How about the above scheme divided by 2?
>
> The specific scheme I was going for was going to be something akin to max(C,
> N) where N is the number of slots moved and C is the difference between the
> largest influence of an affected position and the lowest influence.
Hmm, yes. Looking at a table for both, it depends on whether you think
players should be able to move through multiple named positions in a single
week. My feeling is no; moving a single named position should take all your
savings for that week (brings stability to offices). Here's the two tables,
any further thoughts looking at them?
G.'s scheme: sum of all positions over which one jumps, inclusive, divided by 2:
[,1] [,2] [,3] [,4] [,5] [,6] [,7] [,8] [,9] [,10] [,11] [,12] [,13]
[,14] [,15]
[1,] 0 8 11 13 13 14 15 16 17 18 19 20 21
22 23
[2,] 8 0 6 8 8 9 10 11 12 13 14 15 16
17 18
[3,] 11 6 0 5 5 6 7 8 9 10 11 12 13
14 15
[4,] 13 8 5 0 2 3 4 5 6 7 8 9 10
11 12
[5,] 13 8 5 2 0 1 2 3 4 5 6 7 8
9 10
[6,] 14 9 6 3 1 0 2 3 4 5 6 7 8
9 10
[7,] 15 10 7 4 2 2 0 2 3 4 5 6 7
8 9
[8,] 16 11 8 5 3 3 2 0 2 3 4 5 6
7 8
[9,] 17 12 9 6 4 4 3 2 0 2 3 4 5
6 7
[10,] 18 13 10 7 5 5 4 3 2 0 2 3 4
5 6
[11,] 19 14 11 8 6 6 5 4 3 2 0 2 3
4 5
[12,] 20 15 12 9 7 7 6 5 4 3 2 0 2
3 4
[13,] 21 16 13 10 8 8 7 6 5 4 3 2 0
2 3
[14,] 22 17 14 11 9 9 8 7 6 5 4 3 2
0 2
[15,] 23 18 15 12 10 10 9 8 7 6 5 4 3
2 0
coppro's scheme: max(# of positions jumped, difference between influences):
[,1] [,2] [,3] [,4] [,5] [,6] [,7] [,8] [,9] [,10] [,11] [,12] [,13]
[,14] [,15]
[1,] 0 3 5 5 10 8 8 8 8 9 10 11 12
13 14
[2,] 3 0 2 2 7 5 5 6 7 8 9 10 11
12 13
[3,] 5 2 0 1 5 3 4 5 6 7 8 9 10
11 12
[4,] 5 2 1 0 5 3 3 4 5 6 7 8 9
10 11
[5,] 10 7 5 5 0 2 2 3 4 5 6 7 8
9 10
[6,] 8 5 3 3 2 0 1 2 3 4 5 6 7
8 9
[7,] 8 5 4 3 2 1 0 1 2 3 4 5 6
7 8
[8,] 8 6 5 4 3 2 1 0 1 2 3 4 5
6 7
[9,] 8 7 6 5 4 3 2 1 0 1 2 3 4
5 6
[10,] 9 8 7 6 5 4 3 2 1 0 1 2 3
4 5
[11,] 10 9 8 7 6 5 4 3 2 1 0 1 2
3 4
[12,] 11 10 9 8 7 6 5 4 3 2 1 0 1
2 3
[13,] 12 11 10 9 8 7 6 5 4 3 2 1 0
1 2
[14,] 13 12 11 10 9 8 7 6 5 4 3 2 1
0 1
[15,] 14 13 12 11 10 9 8 7 6 5 4 3 2
1 0
-G.
