package com.asmor.dnd;
public class montecarlo {
private static int d6() {
return (int) Math.floor(Math.random()*6)+1;
}
private static int stat(int r1, int r2, int r3, int r4) {
int dice[]=new int[4], smallest=0, i, toReturn=0;
dice[0]=r1;
dice[1]=r2;
dice[2]=r3;
dice[3]=r4;
for (i=1; i<4; i++) {
if (dice[i]<dice[smallest]) {
smallest=i;
}
}
for (i=0; i<4; i++) {
if (i!=smallest) {
toReturn+=dice[i];
}
}
return toReturn;
}
public static void main(String[] args) {
int totalValue=0, iterations, iterate=0, tossed=0, kept=0, stats[]=new int[7], mods[]={-5, -5, -4, -4, -3, -3, -2, -2, -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4}, i, toss, totalMod, pbv, cameUp[]=new int[19];
int PBValues[]={0, 0, 0, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 8, 10, 13, 16};
//Number of good character to generate:
iterations=1000000;
while (kept<iterations) {
iterate++;
for (i=0; i<6; i++) {
stats[i]=stat(d6(), d6(), d6(), d6());
}
toss=1;
totalMod=0;
for (i=0; i<6; i++) {
if (stats[i]>13) {
toss=0;
}
totalMod+=mods[stats[i]];
}
if (totalMod<=0) {
toss=1;
}
if (toss==0) {
kept++;
pbv=0;
for (i=0; i<6; i++) {
pbv+=PBValues[stats[i]];
}
totalValue+=pbv;
} else if (toss==1) {
tossed++;
}
}
System.out.print((double)totalValue/(double)iterations+"\n");
System.out.print("Total iterations: "+iterate+"\nCharacters tossed: "+tossed+"\nCharacters kept: "+kept+"\n");
}
}
I got the same result as you running your program on my computer, but I did notice that even after commenting out the extraneous reporting to System.out, it was significantly slower than mine...
