Created
September 18, 2012 14:30
-
-
Save billowdood/3743445 to your computer and use it in GitHub Desktop.
Generaciones
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
private void primerGeneracionGeneral(){ | |
int i; | |
for(i = 0;i < largo;i++){ | |
//Si es la celda central,pon 1[celda encendida]...modificarlo para que encuentra le celda media | |
// System.out.println("["+i+"]"); | |
if(i == (largo /2)){ | |
//System.out.println("["+i+"]"); | |
generacionAnterior[i] = 1; | |
//System.out.println("Valor "+generacionAnterior[i]); | |
} | |
//Si es cualquier otra,apagala | |
else{ | |
generacionAnterior[i] = 0; | |
} | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
private void primerGeneracionRandom(){ | |
int i,decision; | |
Random randoms = new Random(); | |
for(i = 0;i < largo;i++){ | |
//Si es la celda central,pon 1[celda encendida]...modificarlo para que encuentra le celda media | |
// System.out.println("["+i+"]"); | |
decision = randoms.nextInt(1000) % 2; | |
if(decision == 1){ | |
generacionAnterior[i] = 1; | |
} | |
//Si es cualquier otra,apagala | |
else{ | |
generacionAnterior[i] = 0; | |
} | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
private void nuevaGeneracion(){ | |
setCoeficientes(); | |
int iteraciones = 0; | |
int[] numeroBinario = new int[3]; | |
numeroBinario[0] = generacionAnterior[coeficientes[0]]; | |
numeroBinario[1] = generacionAnterior[coeficientes[1]]; | |
numeroBinario[2] = generacionAnterior[coeficientes[2]]; | |
do{ | |
generacionNueva[coeficientes[3]] = automata.busquedaEnHashMapRegla(numeroBinario); | |
aumentarCoeficientes(); | |
avanzarCeldas(numeroBinario); | |
iteraciones++; | |
}while(iteraciones < largo); | |
System.arraycopy(generacionNueva,0,generacionAnterior,0,generacionNueva.length); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment