Reply to thread

Message

<blockquote data-quote="Asmor" data-source="post: 2173510" data-attributes="member: 1154">Well, I made a program in Java to try and roll up every character imaginable, and ditch the &quot;worthless&quot; ones (worthless being +0 or less total mods OR no score higher than 13).It's running right now, and I've got it giving me a &quot;status update&quot; every 6^8 characters... They're roughly 1 second apart. Which I believe means it should take around 6^16 seconds, which is well over 700 MILLION hours.Here's the code, if anyone wants to try to optimize it (I'm a java noob) or port it to a faster, native language...[code]package com.asmor.dnd4d6dlcalc;public class dnd4d6dlcalc {public static int getMod(int stat) {&nbsp; &nbsp; return (stat/2)-5;}public static int getStat(int die1, int die2, int die3, int die4) {&nbsp; &nbsp; int dice[]={0, 0, 0, 0, 0}, lowest, i, toReturn;&nbsp; &nbsp; dice[1]=die1;&nbsp; &nbsp; dice[2]=die2;&nbsp; &nbsp; dice[3]=die3;&nbsp; &nbsp; dice[4]=die4;&nbsp; &nbsp; lowest=1;&nbsp; &nbsp; for (i=1; i&lt;5; i++) {&nbsp; &nbsp; &nbsp; &nbsp; if (dice[i]&lt;dice[lowest]) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lowest=i;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; toReturn=0;&nbsp; &nbsp; for (i=1; i&lt;5; i++) {&nbsp; &nbsp; &nbsp; &nbsp; if (lowest!=i) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; toReturn+=dice[i];&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; return toReturn;}public static void main(String[] args) {int r01=0, r02=0, r03=0, r04=0, r05=0, r06=0, r07=0,r08=0, r09=0, r10=0, r11=0, r12=0, r13=0, r14=0, r15=0, r16=0, r17=0, r18=0, r19=0, r20=0, r21=0, r22=0, r23=0, r24=0;int scores[]={0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, stats[]={0, 0, 0, 0, 0, 0, 0}, mods[]={0, 0, 0, 0, 0, 0, 0}, toss, i, totalMod;for (r01=1; r01&lt;7; r01++) {for (r02=1; r02&lt;7; r02++) {for (r03=1; r03&lt;7; r03++) {for (r04=1; r04&lt;7; r04++) {for (r05=1; r05&lt;7; r05++) {for (r06=1; r06&lt;7; r06++) {for (r07=1; r07&lt;7; r07++) {for (r08=1; r08&lt;7; r08++) {for (r09=1; r09&lt;7; r09++) {for (r10=1; r10&lt;7; r10++) {for (r11=1; r11&lt;7; r11++) {for (r12=1; r12&lt;7; r12++) {for (r13=1; r13&lt;7; r13++) {for (r14=1; r14&lt;7; r14++) {for (r15=1; r15&lt;7; r15++) {for (r16=1; r16&lt;7; r16++) {for (r17=1; r17&lt;7; r17++) {for (r18=1; r18&lt;7; r18++) {for (r19=1; r19&lt;7; r19++) {for (r20=1; r20&lt;7; r20++) {for (r21=1; r21&lt;7; r21++) {for (r22=1; r22&lt;7; r22++) {for (r23=1; r23&lt;7; r23++) {for (r24=1; r24&lt;7; r24++) {&nbsp; &nbsp; stats[0]=getStat(r01, r02, r03, r04);&nbsp; &nbsp; mods[0]=getMod(stats[0]);&nbsp; &nbsp; stats[1]=getStat(r05, r06, r07, r08);&nbsp; &nbsp; mods[1]=getMod(stats[1]);&nbsp; &nbsp; stats[2]=getStat(r09, r10, r11, r12);&nbsp; &nbsp; mods[2]=getMod(stats[2]);&nbsp; &nbsp; stats[3]=getStat(r13, r14, r15, r16);&nbsp; &nbsp; mods[3]=getMod(stats[3]);&nbsp; &nbsp; stats[4]=getStat(r17, r18, r19, r20);&nbsp; &nbsp; mods[4]=getMod(stats[4]);&nbsp; &nbsp; stats[5]=getStat(r21, r22, r23, r24);&nbsp; &nbsp; mods[5]=getMod(stats[5]);&nbsp; &nbsp; &nbsp; &nbsp; toss=1;&nbsp; &nbsp; for (i=0; i&lt;6; i++) {&nbsp; &nbsp; &nbsp; &nbsp; if (stats[i]&gt;13) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; toss=0;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; totalMod=mods[0]+mods[1]+mods[2]+mods[3]+mods[4]+mods[5];&nbsp; &nbsp; if (totalMod&lt;=0) {&nbsp; &nbsp; &nbsp; &nbsp; toss=1;&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; if (toss==0) {&nbsp; &nbsp; &nbsp; &nbsp; for (i=0; i&lt;6; i++) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; scores[stats[i]]++;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }}}}}}}}}System.out.print(r01+&quot; &quot;+r02+&quot; &quot;+r03+&quot; &quot;+r04+&quot; &quot;+r05+&quot; &quot;+r06+&quot; &quot;+r07+&quot; &quot;+r08+&quot; &quot;+r09+&quot; &quot;+r10+&quot; &quot;+r11+&quot; &quot;+r12+&quot; &quot;+r13+&quot; &quot;+r14+&quot; &quot;+r15+&quot; &quot;+r16+&quot; &quot;+r17+&quot; &quot;+r18+&quot; &quot;+r19+&quot; &quot;+r20+&quot; &quot;+r21+&quot; &quot;+r22+&quot; &quot;+r23+&quot; &quot;+r24+&quot;\n&quot;);}}}}}}}}}}}}}}}}String outString=&quot;&quot;;for (i=3; i&lt;19; i++) {&nbsp; &nbsp; outString+=i+&quot;: &quot;+scores[i]+&quot;\n&quot;;}System.out.print(outString);}}[/code]</blockquote>

[QUOTE="Asmor, post: 2173510, member: 1154"] Well, I made a program in Java to try and roll up every character imaginable, and ditch the "worthless" ones (worthless being +0 or less total mods OR no score higher than 13). It's running right now, and I've got it giving me a "status update" every 6^8 characters... They're roughly 1 second apart. Which I believe means it should take around 6^16 seconds, which is well over 700 MILLION hours. Here's the code, if anyone wants to try to optimize it (I'm a java noob) or port it to a faster, native language... [code] package com.asmor.dnd4d6dlcalc; public class dnd4d6dlcalc { public static int getMod(int stat) { return (stat/2)-5; } public static int getStat(int die1, int die2, int die3, int die4) { int dice[]={0, 0, 0, 0, 0}, lowest, i, toReturn; dice[1]=die1; dice[2]=die2; dice[3]=die3; dice[4]=die4; lowest=1; for (i=1; i<5; i++) { if (dice[i]<dice[lowest]) { lowest=i; } } toReturn=0; for (i=1; i<5; i++) { if (lowest!=i) { toReturn+=dice[i]; } } return toReturn; } public static void main(String[] args) { int r01=0, r02=0, r03=0, r04=0, r05=0, r06=0, r07=0,r08=0, r09=0, r10=0, r11=0, r12=0, r13=0, r14=0, r15=0, r16=0, r17=0, r18=0, r19=0, r20=0, r21=0, r22=0, r23=0, r24=0; int scores[]={0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, stats[]={0, 0, 0, 0, 0, 0, 0}, mods[]={0, 0, 0, 0, 0, 0, 0}, toss, i, totalMod; for (r01=1; r01<7; r01++) { for (r02=1; r02<7; r02++) { for (r03=1; r03<7; r03++) { for (r04=1; r04<7; r04++) { for (r05=1; r05<7; r05++) { for (r06=1; r06<7; r06++) { for (r07=1; r07<7; r07++) { for (r08=1; r08<7; r08++) { for (r09=1; r09<7; r09++) { for (r10=1; r10<7; r10++) { for (r11=1; r11<7; r11++) { for (r12=1; r12<7; r12++) { for (r13=1; r13<7; r13++) { for (r14=1; r14<7; r14++) { for (r15=1; r15<7; r15++) { for (r16=1; r16<7; r16++) { for (r17=1; r17<7; r17++) { for (r18=1; r18<7; r18++) { for (r19=1; r19<7; r19++) { for (r20=1; r20<7; r20++) { for (r21=1; r21<7; r21++) { for (r22=1; r22<7; r22++) { for (r23=1; r23<7; r23++) { for (r24=1; r24<7; r24++) { stats[0]=getStat(r01, r02, r03, r04); mods[0]=getMod(stats[0]); stats[1]=getStat(r05, r06, r07, r08); mods[1]=getMod(stats[1]); stats[2]=getStat(r09, r10, r11, r12); mods[2]=getMod(stats[2]); stats[3]=getStat(r13, r14, r15, r16); mods[3]=getMod(stats[3]); stats[4]=getStat(r17, r18, r19, r20); mods[4]=getMod(stats[4]); stats[5]=getStat(r21, r22, r23, r24); mods[5]=getMod(stats[5]); toss=1; for (i=0; i<6; i++) { if (stats[i]>13) { toss=0; } } totalMod=mods[0]+mods[1]+mods[2]+mods[3]+mods[4]+mods[5]; if (totalMod<=0) { toss=1; } if (toss==0) { for (i=0; i<6; i++) { scores[stats[i]]++; } } }}}} }}}} System.out.print(r01+" "+r02+" "+r03+" "+r04+" "+r05+" "+r06+" "+r07+" "+r08+" "+r09+" "+r10+" "+r11+" "+r12+" "+r13+" "+r14+" "+r15+" "+r16+" "+r17+" "+r18+" "+r19+" "+r20+" "+r21+" "+r22+" "+r23+" "+r24+"\n"); }}}} }}}} }}}} }}}} String outString=""; for (i=3; i<19; i++) { outString+=i+": "+scores[i]+"\n"; } System.out.print(outString); } } [/code] [/QUOTE]

Verification