How can I generate pseudorandom numbers in p3sim assembler
up vote
0
down vote
favorite
How can I do it if I want to generate numbers between x and y.Or how could I import the time in miliseconds if I wanted to use that method
assembly
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
asked Nov 18 at 18:33
GSTIG
1
add a comment |
up vote
0
down vote
favorite
How can I do it if I want to generate numbers between x and y.Or how could I import the time in miliseconds if I wanted to use that method
assembly
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
asked Nov 18 at 18:33
GSTIG
1
seeding a PRNG with the time is a separate question from choosing a PRNG algorithm to generate a (uniform?) distribution of integers over a range. What quality of random numbers do you need? Like cryptographically secure? Good enough for numeric simulations? Or super-simple like a linear congurential generator? I don't know p3, but if it doesn't have divide / modulo then an xorshift+ generator might be the easiest fast PRNG to implement.
– Peter Cordes
Nov 18 at 18:37
Just super simple hex numbers in a range
– GSTIG
Nov 18 at 18:40
Hex is a text serialization format for numbers. It has nothing to do with how you generate the binary integer in a register or memory. Anyway, if you want simple, google linear congruential generator and/or xorshift+ and take your pick.
– Peter Cordes
Nov 18 at 18:42
hex as in hexadecimal.Thanks
– GSTIG
Nov 18 at 18:45
That's what I was talking about. Numbers in registers are in binary. You can convert a number to / from a hex or decimal ASCII string to print it or read it, butaddinstructions work on binary numbers.
– Peter Cordes
Nov 18 at 18:53
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
How can I do it if I want to generate numbers between x and y.Or how could I import the time in miliseconds if I wanted to use that method
assembly
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
asked Nov 18 at 18:33
GSTIG
1
How can I do it if I want to generate numbers between x and y.Or how could I import the time in miliseconds if I wanted to use that method
assembly
assembly
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
asked Nov 18 at 18:33
GSTIG
1
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
asked Nov 18 at 18:33
GSTIG
1
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
edited Nov 19 at 0:40
K.Dᴀᴠɪs
6,017102140
6,017102140
asked Nov 18 at 18:33
GSTIG
1
asked Nov 18 at 18:33
GSTIG
1
asked Nov 18 at 18:33
GSTIG
1
1
seeding a PRNG with the time is a separate question from choosing a PRNG algorithm to generate a (uniform?) distribution of integers over a range. What quality of random numbers do you need? Like cryptographically secure? Good enough for numeric simulations? Or super-simple like a linear congurential generator? I don't know p3, but if it doesn't have divide / modulo then an xorshift+ generator might be the easiest fast PRNG to implement.
– Peter Cordes
Nov 18 at 18:37
Just super simple hex numbers in a range
– GSTIG
Nov 18 at 18:40
Hex is a text serialization format for numbers. It has nothing to do with how you generate the binary integer in a register or memory. Anyway, if you want simple, google linear congruential generator and/or xorshift+ and take your pick.
– Peter Cordes
Nov 18 at 18:42
hex as in hexadecimal.Thanks
– GSTIG
Nov 18 at 18:45
That's what I was talking about. Numbers in registers are in binary. You can convert a number to / from a hex or decimal ASCII string to print it or read it, butaddinstructions work on binary numbers.
– Peter Cordes
Nov 18 at 18:53
add a comment |
seeding a PRNG with the time is a separate question from choosing a PRNG algorithm to generate a (uniform?) distribution of integers over a range. What quality of random numbers do you need? Like cryptographically secure? Good enough for numeric simulations? Or super-simple like a linear congurential generator? I don't know p3, but if it doesn't have divide / modulo then an xorshift+ generator might be the easiest fast PRNG to implement.
– Peter Cordes
Nov 18 at 18:37
Just super simple hex numbers in a range
– GSTIG
Nov 18 at 18:40
Hex is a text serialization format for numbers. It has nothing to do with how you generate the binary integer in a register or memory. Anyway, if you want simple, google linear congruential generator and/or xorshift+ and take your pick.
– Peter Cordes
Nov 18 at 18:42
hex as in hexadecimal.Thanks
– GSTIG
Nov 18 at 18:45
That's what I was talking about. Numbers in registers are in binary. You can convert a number to / from a hex or decimal ASCII string to print it or read it, butaddinstructions work on binary numbers.
– Peter Cordes
Nov 18 at 18:53
seeding a PRNG with the time is a separate question from choosing a PRNG algorithm to generate a (uniform?) distribution of integers over a range. What quality of random numbers do you need? Like cryptographically secure? Good enough for numeric simulations? Or super-simple like a linear congurential generator? I don't know p3, but if it doesn't have divide / modulo then an xorshift+ generator might be the easiest fast PRNG to implement.
– Peter Cordes
Nov 18 at 18:37
seeding a PRNG with the time is a separate question from choosing a PRNG algorithm to generate a (uniform?) distribution of integers over a range. What quality of random numbers do you need? Like cryptographically secure? Good enough for numeric simulations? Or super-simple like a linear congurential generator? I don't know p3, but if it doesn't have divide / modulo then an xorshift+ generator might be the easiest fast PRNG to implement.
– Peter Cordes
Nov 18 at 18:37
Just super simple hex numbers in a range
– GSTIG
Nov 18 at 18:40
Just super simple hex numbers in a range
– GSTIG
Nov 18 at 18:40
Hex is a text serialization format for numbers. It has nothing to do with how you generate the binary integer in a register or memory. Anyway, if you want simple, google linear congruential generator and/or xorshift+ and take your pick.
– Peter Cordes
Nov 18 at 18:42
Hex is a text serialization format for numbers. It has nothing to do with how you generate the binary integer in a register or memory. Anyway, if you want simple, google linear congruential generator and/or xorshift+ and take your pick.
– Peter Cordes
Nov 18 at 18:42
hex as in hexadecimal.Thanks
– GSTIG
Nov 18 at 18:45
hex as in hexadecimal.Thanks
– GSTIG
Nov 18 at 18:45
That's what I was talking about. Numbers in registers are in binary. You can convert a number to / from a hex or decimal ASCII string to print it or read it, but
add instructions work on binary numbers.– Peter Cordes
Nov 18 at 18:53
That's what I was talking about. Numbers in registers are in binary. You can convert a number to / from a hex or decimal ASCII string to print it or read it, but
add instructions work on binary numbers.– Peter Cordes
Nov 18 at 18:53
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53364207%2fhow-can-i-generate-pseudorandom-numbers-in-p3sim-assembler%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
seeding a PRNG with the time is a separate question from choosing a PRNG algorithm to generate a (uniform?) distribution of integers over a range. What quality of random numbers do you need? Like cryptographically secure? Good enough for numeric simulations? Or super-simple like a linear congurential generator? I don't know p3, but if it doesn't have divide / modulo then an xorshift+ generator might be the easiest fast PRNG to implement.
– Peter Cordes
Nov 18 at 18:37
Just super simple hex numbers in a range
– GSTIG
Nov 18 at 18:40
Hex is a text serialization format for numbers. It has nothing to do with how you generate the binary integer in a register or memory. Anyway, if you want simple, google linear congruential generator and/or xorshift+ and take your pick.
– Peter Cordes
Nov 18 at 18:42
hex as in hexadecimal.Thanks
– GSTIG
Nov 18 at 18:45
That's what I was talking about. Numbers in registers are in binary. You can convert a number to / from a hex or decimal ASCII string to print it or read it, but
addinstructions work on binary numbers.– Peter Cordes
Nov 18 at 18:53