CRYPTO SOLVER - v1.2 A CryptoQuote is a simple substition code where each letter that appears may stand for a different letter. The substitutions are consistent throughout the puzzle. Punctuation is not translated For example: POLYYONTOP = RENSSELAER Enter the cryptoquote (end with '$'): Processing: ** A genetic algorithm can be applied to a problem with a very nonlinear search, often it will even solve the problem in an unexpected manner, or it may find a solution which may not be obvious. Initializing: Reading in dictionary..................................................... Searching for solutions to big words: Found nonlinear Found unexpected Seeding adaptable.... Seeding anagram's.... Seeding anaphasic.... Seeding awardable.... Seeding emergency.... Seeding energetic.... Seeding fiftyfold.... Seeding idiotical.... Seeding idiotizes.... Seeding nonlinear.... Seeding condensing.... Seeding consenting.... Seeding contending.... Seeding denouncing.... Seeding forwarders.... Seeding frequented.... Seeding obediences.... Seeding overheated.... Seeding phantasmal.... Seeding quadrantal.... Seeding renouncing.... Seeding unexpected.... Evolving: Gen #50 Fitness:197 Best: ** A venebip alvoribfy pan he addlieg bo a drohley qibf a uerw nonlinear zearpf, okben ib qill euen zolue bfe drohley in an snexdepbeg yanner, or ib yaw king a zolsbion qfipf yaw nob he ohuiosz. Gen #100 Fitness:247 Best: ** A genexis algorixfm san he ajjliek xo a jrohlem cixf a very nonlinear tearsf, opxen ix cill even tolve xfe jrohlem in an zneqjesxek manner, or ix may pink a tolzxion cfisf may nox he ohviozt. Gen #150 Fitness:287 Best: ** A veneuij alvoriuqt jan pe addlieg uo a droplet ziuq a kers nonlinear hearjq, owuen iu zill eken holke uqe droplet in an ynexdejueg tanner, or iu tas wing a holyuion zqijq tas nou pe opkioyh. Gen #200 Fitness:335 Best: ** A uenesib aluorisht ban pe addliew so a droplet cish a verm nonlinear yearbh, ozsen is cill even yolve she droplet in an fnekdebsew tanner, or is tam zinw a yolfsion chibh tam nos pe opviofy. Gen #250 Fitness:360 Best: ** A genetiv algorithm van fe applies to a proflem qith a uerw nonlinear cearvh, odten it qill euen colue the proflem in an znejpevtes manner, or it maw dins a colztion qhivh maw not fe ofuiozc. Gen #300 Fitness:384 Best: ** A xenetib alxorithm ban ue applies to a proulem with a very nonlinear dearbh, often it will even dolve the proulem in an jnekpebtes manner, or it may fins a doljtion whibh may not ue ouviojd. Gen #350 Fitness:456 Best: ** A genetic algoritym can be appliek to a problem fity a jerw nonlinear searcy, ovten it fill ejen solje tye problem in an uneqpectek manner, or it maw vink a solution fyicy maw not be objious. Gen #400 Fitness:456 Best: ** A genetic algoritym can be appliek to a problem fity a jerw nonlinear searcy, ovten it fill ejen solje tye problem in an uneqpectek manner, or it maw vink a solution fyicy maw not be objious. Gen #450 Fitness:457 Best: ** A genetij algorithm jan be applies to a problem uith a kery nonlinear qearjh, odten it uill eken qolke the problem in an fnecpejtes manner, or it may dins a qolftion uhijh may not be obkiofq. Gen #500 Fitness:484 Best: ** A genetic algorithm can be avvliej to a vroblem fith a kery nonlinear search, opten it fill eken solke the vroblem in an unewvectej manner, or it may pinj a solution fhich may not be obkious. Gen #550 Fitness:582 Best: ** A genetic algorithm can we abbliez to a browlem kith a very nonlinear search, often it kill even solve the browlem in an unedbectez manner, or it may finz a solution khich may not we owvious. Gen #600 Fitness:582 Best: ** A genetic algorithm can we abbliez to a browlem kith a very nonlinear search, often it kill even solve the browlem in an unedbectez manner, or it may finz a solution khich may not we owvious. Gen #650 Fitness:582 Best: ** A genetic algorithm can we abbliez to a browlem kith a very nonlinear search, often it kill even solve the browlem in an unedbectez manner, or it may finz a solution khich may not we owvious. Gen #700 Fitness:582 Best: ** A genetic algorithm can we abbliez to a browlem kith a very nonlinear search, often it kill even solve the browlem in an unedbectez manner, or it may finz a solution khich may not we owvious. Gen #750 Fitness:598 Best: ** A genetic algorithm can be applief to a problem kith a jerw nonlinear search, ozten it kill ejen solje the problem in an uneqpectef manner, or it maw zinf a solution khich maw not be objious. Gen #800 Fitness:598 Best: ** A genetic algorithm can be applief to a problem kith a jerw nonlinear search, ozten it kill ejen solje the problem in an uneqpectef manner, or it maw zinf a solution khich maw not be objious. Gen #850 Fitness:598 Best: ** A genetic algorithm can be applief to a problem kith a jerw nonlinear search, ozten it kill ejen solje the problem in an uneqpectef manner, or it maw zinf a solution khich maw not be objious. Gen #900 Fitness:598 Best: ** A genetic algorithm can be applief to a problem kith a jerw nonlinear search, ozten it kill ejen solje the problem in an uneqpectef manner, or it maw zinf a solution khich maw not be objious. Gen #950 Fitness:613 Best: ** A genetic algorithm can be applied to a problem with a kery nonlinear vearch, often it will eken volke the problem in an zneupected manner, or it may find a volztion which may not be obkiozv. Gen #1000 Fitness:713 Best: ** A genetic algorithm can be applied to a problem fith a kerj nonlinear search, ovten it fill eken solke the problem in an unexpected manner, or it maj vind a solution fhich maj not be obkious. Gen #1050 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1100 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1150 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1200 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1250 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1300 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1350 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1400 Fitness:828 Best: ** A genetic algorithm can be applied to a problem yith a verk nonlinear search, often it yill even solve the problem in an unexpected manner, or it mak find a solution yhich mak not be obvious. Gen #1450 Fitness:828 Best: ** A genetic algorithm can be applied to a problem zith a verk nonlinear search, often it zill even solve the problem in an unexpected manner, or it mak find a solution zhich mak not be obvious. Gen #1500 Fitness:828 Best: ** A genetic algorithm can be applied to a problem zith a verk nonlinear search, often it zill even solve the problem in an unexpected manner, or it mak find a solution zhich mak not be obvious. Gen #1550 Fitness:828 Best: ** A genetic algorithm can be applied to a problem zith a verk nonlinear search, often it zill even solve the problem in an unexpected manner, or it mak find a solution zhich mak not be obvious. Gen #1600 Fitness:828 Best: ** A genetic algorithm can be applied to a problem zith a verk nonlinear search, often it zill even solve the problem in an unexpected manner, or it mak find a solution zhich mak not be obvious. Gen #1650 Fitness:860 Best: ** A genetic algorithm can be applied to a problem kith a verq nonlinear search, often it kill even solve the problem in an unexpected manner, or it maq find a solution khich maq not be obvious. Gen #1700 Fitness:860 Best: ** A genetic algorithm can be applied to a problem kith a verq nonlinear search, often it kill even solve the problem in an unexpected manner, or it maq find a solution khich maq not be obvious. Gen #1750 Fitness:860 Best: ** A genetic algorithm can be applied to a problem kith a verq nonlinear search, often it kill even solve the problem in an unexpected manner, or it maq find a solution khich maq not be obvious. Gen #1800 Fitness:885 Best: ** A genetic algorithm can be applied to a problem with a verz nonlinear search, often it will even solve the problem in an unexpected manner, or it maz find a solution which maz not be obvious. Gen #1850 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #1900 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #1950 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2000 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2050 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2100 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2150 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2200 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2250 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2300 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2350 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2400 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2450 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2500 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2550 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2600 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2650 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2700 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2750 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2800 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2850 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2900 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #2950 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #3000 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #3050 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #3100 Fitness:894 Best: ** A genetic algorithm can be applied to a problem kith a very nonlinear search, often it kill even solve the problem in an unexpected manner, or it may find a solution khich may not be obvious. Gen #3150 Fitness:919 Best: ** A genetic algorithm can be applied to a problem with a very nonlinear search, often it will even solve the problem in an unexpected manner, or it may find a solution which may not be obvious. Gen #3200 Fitness:919 Best: ** A genetic algorithm can be applied to a problem with a very nonlinear search, often it will even solve the problem in an unexpected manner, or it may find a solution which may not be obvious. Gen #3250 Fitness:919 Best: ** A genetic algorithm can be applied to a problem with a very nonlinear search, often it will even solve the problem in an unexpected manner, or it may find a solution which may not be obvious. Gen #3300 Fitness:919 Best: ** A genetic algorithm can be applied to a problem with a very nonlinear search, often it will even solve the problem in an unexpected manner, or it may find a solution which may not be obvious. Gen #3350 Fitness:919 Best: ** A genetic algorithm can be applied to a problem with a very nonlinear search, often it will even solve the problem in an unexpected manner, or it may find a solution which may not be obvious.