Many thanks to Cactus Kev for his elegant Poker Hand Evaluator. If you know who he is, please forward my thanks! Click here to read his logic
Bellaso Cipher
In 1997 I attended a seminar at University of Tennessee Space Institute entitled "Genentic Algorithms and Neural Networks". During the class we wrote a program to search the target sentence "A quick brown fox ...". Genetic algorithms (GA) are used to find solutiuons to problems where:
David E. Goldberg taught the course at UTSI. More information about Genetic Algorithms.
This is my latest implementation using a GA to find the shortest route between the state capitals. An exhaustive search would require 6.08e62 route calculations. This is based on a given starting point, where the other 49 capitals can be arranged in any order. GA may require around a million route evaluations (population count times number of generations).
Bitcoin Block Viewer