fastest way to do a count

Anything beyond the basics in using the LiveCode language. Share your handlers, functions and magic here.

Moderators: Klaus, FourthWorld, heatherlaine, robinmiller, kevinmiller

syedhoque1994
Posts: 25
Joined: Thu Oct 13, 2011 12:13 pm

Re: fastest way to do a count

Post by syedhoque1994 » Mon Dec 12, 2011 11:32 am

I am working on the score field in 8 Puzzle, and would like to know what is the correct code that means that 50 points are added to the current score when the user moves a tile, loses 25 points when the shuffle button is activated and 500 points are added to the current score.

Syed.

adventuresofgreg
Posts: 314
Joined: Tue Oct 28, 2008 1:23 am
Contact:

Re: fastest way to do a count

Post by adventuresofgreg » Mon Dec 12, 2011 4:45 pm

Hi Bernd: The counts are exactly the same, but the averages are slightly off. My averages are smaller for smaller counts, and both of our averages tend to get very close with larger counts. your count / your sum is correct, so your sum might include the original lookup word 1 value. I fixed it. I went back to your original simpler script, and for each case, I just subtracted the lookupvalue from the sum, and subtracted 1 from the count. The results were identical to mine.

As far as the time difference goes between our 2 scripts, I set mine to run the 100,000 line field last night and it finished running this morning.

bn
VIP Livecode Opensource Backer
VIP Livecode Opensource Backer
Posts: 3333
Joined: Sun Jan 07, 2007 9:12 pm
Location: Bochum, Germany

Re: fastest way to do a count

Post by bn » Mon Dec 12, 2011 8:32 pm

Hi Gregg,

that is interesting. Maybe I did not understand exactly what you were trying to do. To explain what the logic in the stack does:
It counts the recurrences of a number pattern that has a number as second part.
The first occurrence of the number pattern is not counted and the second part is not summed up to do an average of the second parts (word 2) of the line. This is only done on recurrences of the pattern.
The sum of word 2 of the recurrences is divided by the count of the recurrences. I.e. the total count of the number pattern - 1.

I tested with a very small subset of the type of data you indicated:
first:
1,1,1 0.393107
1,1,1 0.425075
1,1,1 0.45005
1,1,1 -0.117383
this gives me:
1,1,1 3
= three recurrences of pattern 1,1,1
and
1,1,1 0.757742
= the sum of the recurrences of pattern 1,1,1 is 0.757742
and
1,1,1 0.252581
the average of the recurrences is 0.252581

If I calculate this manually (spreadsheet) I get
sum of
0.425075
0.45005
-0.117383
is 0.757742

and the average is
0.757742 divided by three = 0,252580666666667

This looks ok if my assumptions are right.

maybe you could test this with my test set:

1,1,1 0.393107
1,1,1 0.425075
1,1,1 0.45005
1,1,1 -0.117383
1,1,2 0.274226
1,1,2 0.409091
1,1,2 0.337163
1,2,1 0.317183
2,1,1 -0.215285
2,1,1 0.04046
2,1,1 -0.349151
2,1,2 -0.19031
2,1,2 -0.27023
2,2,1 -0.422078
2,2,2 -0.272228


for the test set my averages are
1,1,1 0.252581
1,1,2 0.373127
1,2,1 0.317183
2,1,1 -0.154345
2,1,2 -0.27023
2,2,1 -0.422078
2,2,2 -0.272228

and tell me what is going on.

I am glad it works for you but I also would like to know where the difference in results comes from. I would have to check the logic of the algorithm again. But from my understanding of the problem it seems to work.

Kind regards

Bernd

Post Reply

Return to “Talking LiveCode”