| --- Log opened Tue Jan 01 00:00:06 2008 |
| 01:09 | | You're now known as TheWatcher[T-2] |
| 01:14 | | You're now known as TheWatcher[zZzZ] |
| 01:17 | | SpectralVapor [~SpectralV@Nightstar-25813.nwrknj.fios.verizon.net] has joined #Code |
| 01:37 | | Vornotron is now known as Finerty |
| 02:47 | | SpectralVapor [~SpectralV@Nightstar-25813.nwrknj.fios.verizon.net] has quit [Ping Timeout] |
| 02:55 | | SpectralVapor [~SpectralV@Nightstar-25813.nwrknj.fios.verizon.net] has joined #Code |
| 02:55 | | * AnnoDomini will be going to sleep soon. |
| 02:55 | <@AnnoDomini> | But first, a problem that's beyond me. |
| 02:57 | <@AnnoDomini> | Given a roll of N six-sided dice, where the highest result counts and every die that came up as 6 adds 1 to the final result (no floating reroll), one wants to achieve at least number M. |
| 02:58 | <@AnnoDomini> | So a roll of 4 dice, falling 1, 4, 6, 6 would result in 8. |
| 02:58 | <@AnnoDomini> | How can one calculate the probability of achieving at least number M with N dice? |
| 02:58 | | * AnnoDomini sleeps. |
| 02:59 | < Finerty> | for any roll, it's max(rolls) + count(rolls, 6) |
| 03:00 | < Finerty> | there's only 60M things for 10d6. |
| 03:02 | < Finerty> | ...even then it's not that hard, let's see. |
| 03:06 | < Finerty> | at least 2 to at least 6 is 1 - ((M-1)/6)**N |
| 03:08 | < Finerty> | At least 7 on up is a bit harder... hmmm... |
| 03:18 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has quit [Connection reset by peer] |
| 03:35 | | SpectralVapor [~SpectralV@Nightstar-25813.nwrknj.fios.verizon.net] has quit [Quit: ] |
| 03:45 | < Finerty> | To get exactly, it's (M-6) choose N * 5**(M+N-6) |
| 06:01 | | ReivOut is now known as Reiver |
| 06:23 | | Forj [~Forj@203.211.126.ns-3357] has quit [Ping Timeout] |
| 07:20 | | Finerty is now known as Vornicus-Latens |
| 07:39 | | Reiver is now known as ReivOut |
| 07:50 | | ReivOut [~reaverta@Admin.Nightstar.Net] has quit [Ping Timeout] |
| 07:51 | | DiceBot [~Reiver@Nightstar-10536.xdsl.xnet.co.nz] has quit [Ping Timeout] |
| 09:21 | | You're now known as TheWatcher |
| 09:46 | | You're now known as TheWatcher[afk] |
| 10:54 | | You're now known as TheWatcher |
| 11:07 | | Chalcedon [~Chalcedon@203.211.126.ns-3357] has quit [Quit: Gone] |
| 11:41 | | AnnoDomini [AnnoDomini@Nightstar-29604.neoplus.adsl.tpnet.pl] has quit [Quit: ACHTUNG! ALLES LOOKENSPEEPERS! Das Internet is nicht fuer gefingerclicken und giffengrabben. Ist easy droppenpacket der routers und overloaden der backbone mit der spammen und der me-tooen. Ist nicht fuer gewerken bei das dumpkopfen. Das mausklicken sichtseeren keepen das bandwit-spewin hans in das pockets muss; relaxen und watchen das cursorblinken.] |
| 11:55 | | AnnoDomini [AnnoDomini@Nightstar-29604.neoplus.adsl.tpnet.pl] has joined #Code |
| 11:55 | | mode/#code [+o AnnoDomini] by ChanServ |
| 12:37 | | AnnoDomini [AnnoDomini@Nightstar-29604.neoplus.adsl.tpnet.pl] has quit [Quit: Why is there a jalapeno in the Aegean Sea?] |
| 12:39 | | AnnoDomini [AnnoDomini@Nightstar-29604.neoplus.adsl.tpnet.pl] has joined #Code |
| 12:39 | | mode/#code [+o AnnoDomini] by ChanServ |
| 12:59 | | You're now known as TheWatcher[afk] |
| 13:37 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has joined #code |
| 13:47 | | AnnoDomini [AnnoDomini@Nightstar-29604.neoplus.adsl.tpnet.pl] has quit [Ping Timeout] |
| 13:54 | | AnnoDomini [AnnoDomini@83.21.78.ns-4559] has joined #Code |
| 13:54 | | mode/#code [+o AnnoDomini] by ChanServ |
| 14:56 | | Xiphias [Ameroth@82.68.15.ns-4527] has joined #code |
| 15:58 | | Vornicus-Latens is now known as Vornicus |
| 16:56 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has quit [Connection reset by peer] |
| 16:57 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has joined #code |
| 17:19 | | Pi-2 [~sysop@67.183.91.ns-3660] has joined #code |
| 17:19 | | Pi [~sysop@67.183.91.ns-3660] has quit [Ping Timeout] |
| 17:36 | | Xiphias [Ameroth@82.68.15.ns-4527] has quit [Quit: I was never gone] |
| 17:43 | | Attilla_ [~Andrew@Nightstar-23974.ipt.aol.com] has joined #code |
| 17:43 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has quit [Connection reset by peer] |
| 17:46 | | Attilla_ is now known as Attilla |
| 18:17 | | You're now known as TheWatcher |
| 18:26 | | Chalcedon [~Chalcedon@203.211.126.ns-3357] has joined #code |
| 18:26 | | mode/#code [+o Chalcedon] by ChanServ |
| 19:40 | < Vornicus> | Arg. CONCENTRATE |
| 19:41 | | * AnnoDomini starts cooking bacon in front of Vornicus. |
| 19:41 | < Vornicus> | baaaacoooon |
| 19:45 | <@EvilDarkLord> | You're getting enough sleep, right Vorn? |
| 19:45 | < Vornicus> | Yes. |
| 20:11 | | Chalcedon [~Chalcedon@203.211.126.ns-3357] has quit [Ping Timeout] |
| 20:11 | | Chalcedon [~Chalcedon@Nightstar-2443.ue.woosh.co.nz] has joined #code |
| 20:11 | | mode/#code [+o Chalcedon] by ChanServ |
| 20:17 | | Forj [~Forj@Nightstar-2443.ue.woosh.co.nz] has joined #code |
| 20:17 | | mode/#code [+o Forj] by ChanServ |
| 20:18 | | Forj is now known as Chalcy |
| 20:24 | | Chalcy [~Forj@Nightstar-2443.ue.woosh.co.nz] has quit [Connection reset by peer] |
| 20:38 | | You're now known as TheWatcher[afk] |
| 20:40 | | Vornicus [~vorn@ServicesOp.Nightstar.Net] has quit [Quit: Leaving] |
| 20:41 | | Vornicus [~vorn@64.252.69.ns-26941] has joined #code |
| 20:41 | | mode/#code [+o Vornicus] by ChanServ |
| 20:49 | | Forj [~Forj@203.211.126.ns-3357] has joined #code |
| 20:49 | | mode/#code [+o Forj] by ChanServ |
| 20:49 | | Forj [~Forj@203.211.126.ns-3357] has quit [Connection reset by peer] |
| 20:51 | | Pi-2 [~sysop@67.183.91.ns-3660] has quit [Ping Timeout] |
| 20:52 | | Forj [~Forj@203.211.126.ns-3357] has joined #code |
| 20:52 | | mode/#code [+o Forj] by ChanServ |
| 20:52 | | Forj is now known as Chalcy |
| 21:11 | <@AnnoDomini> | Hrm. Anyone know what 'function maximalization' might mean in context of using genetic algorithms to achieve it? |
| 21:18 | <@McM[SanDiego]> | You have some function f(x) |
| 21:18 | | You're now known as TheWatcher |
| 21:18 | <@AnnoDomini> | Yeah. |
| 21:18 | <@McM[SanDiego]> | You want to find an x such that f(x) is the largest valus possible. |
| 21:18 | <@McM[SanDiego]> | So, for f(x) = 3-x^2, for instance, you want it to find 0. |
| 21:18 | <@McM[SanDiego]> | value, not valus |
| 21:19 | <@AnnoDomini> | Oh... so I find the argument value which are subjected to a specific function and try to find when the result is highest? |
| 21:20 | <@McM[SanDiego]> | Yes. Gets more interesting when the function has local maxima that are not the best (think a complicated polynomial) or if there are lots of variables so that the search space is enormous. |
| 21:48 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has quit [Ping Timeout] |
| 21:50 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has joined #code |
| 22:14 | | Pi-2 [~sysop@67.183.91.ns-3660] has joined #code |
| 22:25 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has quit [Connection reset by peer] |
| 22:26 | | Attilla [~Andrew@Nightstar-23974.ipt.aol.com] has joined #code |
| 23:33 | | Pi-2 is now known as Pi |
| --- Log closed Wed Jan 02 00:00:12 2008 |