User talk:Darrellp: Difference between revisions
Content added Content deleted
(Why not try RCSNUSP?) |
(Monty Hall Optimizations: Too many?) |
||
| Line 1: | Line 1: | ||
==An Additional Problem to Try== |
==An Additional Problem to Try== |
||
Now that you've done [[RCBF]] in F#, you might also want to try doing [[RCSNUSP]]. The logic is actually very similar so it's not a big challenge; you can probably start with your BF interpreter and adapt it. –[[User:Dkf|Donal Fellows]] 08:48, 25 December 2009 (UTC) |
Now that you've done [[RCBF]] in F#, you might also want to try doing [[RCSNUSP]]. The logic is actually very similar so it's not a big challenge; you can probably start with your BF interpreter and adapt it. –[[User:Dkf|Donal Fellows]] 08:48, 25 December 2009 (UTC) |
||
==Monty Hall Optimizations== |
|||
Hi Darrell, could you check [http://rosettacode.org/wiki/Talk:Monty_Hall_simulation#Is_the_Perl_implementation_correct.3F this talk page section] about a previous Perl implementation that made too many assumptions/optimizations, and make sure that you have not made too many optimisations rather than simulate what happens in the game? Thanks. --[[User:Paddy3118|Paddy3118]] 09:13, 27 December 2009 (UTC) |
|||
Revision as of 09:13, 27 December 2009
An Additional Problem to Try
Now that you've done RCBF in F#, you might also want to try doing RCSNUSP. The logic is actually very similar so it's not a big challenge; you can probably start with your BF interpreter and adapt it. –Donal Fellows 08:48, 25 December 2009 (UTC)
Monty Hall Optimizations
Hi Darrell, could you check this talk page section about a previous Perl implementation that made too many assumptions/optimizations, and make sure that you have not made too many optimisations rather than simulate what happens in the game? Thanks. --Paddy3118 09:13, 27 December 2009 (UTC)