Staredit Network

Staredit Network -> UMS Assistance -> Mathematical functions
Report, edit, etc...Posted by L-inspecteur_Chocolat on 2006-07-30 at 11:43:22
Zeratul_101, Starforge will allow you to input those numbers, as well as a modified staredit.exe, and probably SCMDraft's text trigger editor.
Report, edit, etc...Posted by Zeratul_101 on 2006-07-30 at 15:19:52
you're talking about the absolute max value right? if so, can UBE2 do it?
Report, edit, etc...Posted by L-inspecteur_Chocolat on 2006-07-30 at 18:00:17
I'm fairly sure uberation can do it also. If not, bug LW about it.
Report, edit, etc...Posted by Kenoli on 2006-07-30 at 18:06:23
There is no reason to use such a high number.
Report, edit, etc...Posted by Zeratul_101 on 2006-07-30 at 18:53:56
QUOTE(Kenoli @ Jul 30 2006, 04:06 PM)
There is no reason to use such a high number.
[right][snapback]534951[/snapback][/right]


well, not for this in particular, but i was theorizing about using a single death count to store what would normally be spread across many DC.
Report, edit, etc...Posted by LegacyWeapon on 2006-07-30 at 23:55:51
SC does not used signed numbers only certain programs do. The range of a death count is 0 - 4294967295.
Report, edit, etc...Posted by L-inspecteur_Chocolat on 2006-07-31 at 08:35:45
Starcraft's Scores(Death Counts, Resources, etc) are displayed as signed integers.
Report, edit, etc...Posted by Zeratul_101 on 2006-07-31 at 13:38:53
QUOTE(L-inspecteur_Chocolat @ Jul 31 2006, 06:35 AM)
Starcraft's Scores(Death Counts, Resources, etc) are displayed as signed integers.
[right][snapback]535348[/snapback][/right]


you can have negative minerals. lmfao.

anyhow, i still need my second question answered. refer to my first post.
Report, edit, etc...Posted by DT_Battlekruser on 2006-07-31 at 15:45:12
QUOTE(LegacyWeapon @ Jul 30 2006, 08:55 PM)
SC does not used signed numbers only certain programs do. The range of a death count is 0 - 4294967295.
[right][snapback]535187[/snapback][/right]


Starcraft does use signed integers. The range of deaths counts is, as Kenoli stated, from -2147483648 to 2147483647.

Byte values 00000080 or more start at -2147483648 and proceed up to -1 at FFFFFFFF.

Same thing with Unit ID in EUD actions/conditions, it's a word but the range is -32767 to 32767, not 0 to 65535.
Report, edit, etc...Posted by Zeratul_101 on 2006-08-01 at 13:35:27
since no one is really answering my second question, i've decided to modifiy the grid itself. giving a slope of 1/2, following the isometrical angle. theoritically, i should be able to treat it exactly like a normal grid. if this is false, then please say so.
Report, edit, etc...Posted by Zeratul_101 on 2006-08-11 at 12:55:32
well, that slope didn't work, i will need the grid to be diamond shaped. that in itself is quite the problem and is another request for help. i need to be able to find out both x,y coordinates of a diamond shaped grid using only 3 values - listed below.

this is how the grid would look in its entirety. the Xs are just line markers and give a spot to center location on. there are some blank spots, but don't worry about those. each x is a value of 1, increasing left to right and bottom to top.
CODE


x              1,4
x          1,3     2,4
x      1,2    2,3     3,4
x 1,1     2,2      3,3    4,4
x      2,1    3,2     4,3
x          3,1     4,2
x               4,1
    x   x  x   x   x   x   x


now, you have to find the x,y coordinates using only three pieces of information.

x and y axis refer to the vertical(Y) and horizontal(X) lines of Xs

the individual Y and X-axis values
the sum of the Y and X-axis
the value of each column(X-axis value + 1)(as shown below)
CODE

     5
   4  6
 3  5  7
2  4  6  8
 3  5  7
   4  6
     5


i've found a method, after about half a weeks work. but i'm wondering if theres a better one i haven't discovered yet

ADDITION:
don't mind the messed up grids, i think you can get the point

ADDITION:
QUOTE(in_a_biskit @ Jun 27 2006, 03:28 AM)
Alternatively, you can try to use Euclid's Algorithm to find the greatest common divisor d.  Euclid's algorithm works at the speed of light, and looks like this:
Divide a by b and find the remainder r[sub]1[/sub].  Then divide b by r[sub]1[/sub] and find the remainder r[sub]2[/sub].  Divide r[sub]1[/sub] by r[sub]2[/sub] and find the remainder r[sub]3[/sub], and so on. Continue until r[sub]n[/sub] = 0, and then r[sub]n-1[/sub] = d, the lowest common denominator.
[codebox]Example: find the greatest common divisor of 138 and 96.

  138 = 1*96 + 42    (i.e. r[sub]1[/sub] = 42)
  96 = 2*42 + 12
  42 = 3*12 +  6
  12 = 2*6 (+ 0)

So the greatest common divisor of 138 and 96 is 6.
So the ratio 138:96 in lowest terms is 138/6:96/6 = 23:16[/codebox]I will be very impressed with anyone who can put this in their map biggrin.gif
[right][snapback]514212[/snapback][/right]


say 138 = A
say 96 = B

what happens if A happened to be lower than B? would you just switch them around?
Next Page (3)