You are on page 1of 11

Universidad Politcnica Metropolitana de Puebla

Ingeniera en Sistemas Computacionales


Inteligencia Artificial
20 nodos con diagrama
Omar Magadn Gonzlez
10/06/15

package more;
public class ListaLigada{
Nodo r,n1,n2,n3,n4,n5,n6,n7,n8,n9,
n10,n11,n12,n13,n14,n15,n16,
n17,n18,n19,n20 = new Nodo();
public static void main(String[] args) {
}
public void AsignLink(){
n1.s[0][0]=r.empty;
n1.s[0][1]=1;
n1.s[0][2]=2;
n1.s[1][0]=3;
n1.s[1][1]=4;
n1.s[1][2]=5;
n1.s[2][0]=6;
n1.s[2][1]=7;
n1.s[2][2]=8;
n1.setNext(n2);

n2.s[0][0]=1;
n2.s[0][1]=r.empty;
n2.s[0][2]=2;
n2.s[1][0]=3;
n2.s[1][1]=4;
n2.s[1][2]=5;
n2.s[2][0]=6;
n2.s[2][1]=7;
n2.s[2][2]=8;
n2.setNext(n3);

n3.s[0][0]=1;

n3.s[0][1]=2;
n3.s[0][2]=r.empty;
n3.s[1][0]=3;
n3.s[1][1]=4;
n3.s[1][2]=5;
n3.s[2][0]=6;
n3.s[2][1]=7;
n3.s[2][2]=8;
n3.setNext(n4);

n4.s[0][0]=1;
n4.s[0][1]=2;
n4.s[0][2]=5;
n4.s[1][0]=3;
n4.s[1][1]=4;
n4.s[1][2]=r.empty;
n4.s[2][0]=6;
n4.s[2][1]=7;
n4.s[2][2]=8;
n4.setNext(n5);

n5.s[0][0]=1;
n5.s[0][1]=2;
n5.s[0][2]=5;
n5.s[1][0]=3;
n5.s[1][1]=r.empty;
n5.s[1][2]=4;
n5.s[2][0]=6;
n5.s[2][1]=7;
n5.s[2][2]=8;
n5.setNext(n6);

n6.s[0][0]=1;
n6.s[0][1]=2;
n6.s[0][2]=5;
n6.s[1][0]=r.empty;
n6.s[1][1]=3;
n6.s[1][2]=4;
n6.s[2][0]=6;
n6.s[2][1]=7;
n6.s[2][2]=8;
n6.setNext(n7);

n7.s[0][0]=1;
n7.s[0][1]=2;
n7.s[0][2]=5;
n7.s[1][0]=6;
n7.s[1][1]=3;
n7.s[1][2]=4;
n7.s[2][0]=r.empty;
n7.s[2][1]=7;
n7.s[2][2]=8;
n7.setNext(n8);

n8.s[0][0]=1;
n8.s[0][1]=2;
n8.s[0][2]=5;
n8.s[1][0]=6;
n8.s[1][1]=3;
n8.s[1][2]=4;
n8.s[2][0]=7;
n8.s[2][1]=r.empty;

n8.s[2][2]=8;
n8.setNext(n9);

n9.s[0][0]=1;
n9.s[0][1]=2;
n9.s[0][2]=5;
n9.s[1][0]=6;
n9.s[1][1]=3;
n9.s[1][2]=4;
n9.s[2][0]=7;
n9.s[2][1]=8;
n9.s[2][2]=r.empty;
n9.setNext(n10);

n10.s[0][0]=1;
n10.s[0][1]=2;
n10.s[0][2]=5;
n10.s[1][0]=6;
n10.s[1][1]=3;
n10.s[1][2]=r.empty;
n10.s[2][0]=7;
n10.s[2][1]=8;
n10.s[2][2]=4;
n10.setNext(n11);

n11.s[0][0]=1;
n11.s[0][1]=2;
n11.s[0][2]=5;
n11.s[1][0]=6;
n11.s[1][1]=r.empty;
n11.s[1][2]=3;

n11.s[2][0]=7;
n11.s[2][1]=8;
n11.s[2][2]=4;
n11.setNext(n12);

n12.s[0][0]=1;
n12.s[0][1]=2;
n12.s[0][2]=5;
n12.s[1][0]=r.empty;
n12.s[1][1]=6;
n12.s[1][2]=3;
n12.s[2][0]=7;
n12.s[2][1]=8;
n12.s[2][2]=4;
n12.setNext(n13);

n13.s[0][0]=r.empty;
n13.s[0][1]=2;
n13.s[0][2]=5;
n13.s[1][0]=1;
n13.s[1][1]=6;
n13.s[1][2]=3;
n13.s[2][0]=7;
n13.s[2][1]=8;
n13.s[2][2]=4;
n13.setNext(n14);

n14.s[0][0]=2;
n14.s[0][1]=r.empty;
n14.s[0][2]=5;
n14.s[1][0]=1;

n14.s[1][1]=6;
n14.s[1][2]=3;
n14.s[2][0]=7;
n14.s[2][1]=8;
n14.s[2][2]=4;
n14.setNext(n15);

n15.s[0][0]=2;
n15.s[0][1]=5;
n15.s[0][2]=r.empty;
n15.s[1][0]=1;
n15.s[1][1]=6;
n15.s[1][2]=3;
n15.s[2][0]=7;
n15.s[2][1]=8;
n15.s[2][2]=4;
n15.setNext(n16);

n16.s[0][0]=2;
n16.s[0][1]=5;
n16.s[0][2]=3;
n16.s[1][0]=1;
n16.s[1][1]=6;
n16.s[1][2]=r.empty;
n16.s[2][0]=7;
n16.s[2][1]=8;
n16.s[2][2]=4;
n16.setNext(n17);

n17.s[0][0]=2;
n17.s[0][1]=5;

n17.s[0][2]=3;
n17.s[1][0]=1;
n17.s[1][1]=6;
n17.s[1][2]=4;
n17.s[2][0]=7;
n17.s[2][1]=8;
n17.s[2][2]=r.empty;
n17.setNext(n18);

n18.s[0][0]=2;
n18.s[0][1]=5;
n18.s[0][2]=3;
n18.s[1][0]=1;
n18.s[1][1]=6;
n18.s[1][2]=4;
n18.s[2][0]=7;
n18.s[2][1]=r.empty;
n18.s[2][2]=8;
n18.setNext(n19);

n18.s[0][0]=2;
n18.s[0][1]=5;
n18.s[0][2]=3;
n18.s[1][0]=1;
n18.s[1][1]=6;
n18.s[1][2]=4;
n18.s[2][0]=r.empty;
n18.s[2][1]=7;
n18.s[2][2]=8;
n18.setNext(n19);

n19.s[0][0]=2;
n19.s[0][1]=5;
n19.s[0][2]=3;
n19.s[1][0]=1;
n19.s[1][1]=6;
n19.s[1][2]=4;
n19.s[2][0]=r.empty;
n19.s[2][1]=7;
n19.s[2][2]=8;
n19.setNext(n20);

n20.s[0][0]=2;
n20.s[0][1]=5;
n20.s[0][2]=3;
n20.s[1][0]=r.empty;
n20.s[1][1]=6;
n20.s[1][2]=4;
n20.s[2][0]=1;
n20.s[2][1]=7;
n20.s[2][2]=8;
}
public void fill(int [][] s,int [][] s1){

System.arraycopy(s, 0, s1, 0, 9);


//

for (int i = 0; i < s.length; i++) {

//

for (int j = 0; j < s.length; j++) {

//

s[i][j] = s1[i][j];

//

//

}
}
public void print(int [][] s){

for (int i = 0; i < s.length; i++) {


for (int j = 0; j < s.length; j++) {
System.out.println(s[i][j]+" ");
}
System.out.println("\n");
}

}
}

Clase Nodo
public class Nodo {
public int[][] s;
Nodo next;
int empty=-1;
public Nodo(){
s = new int [3][3];
next = null;
}
public void setNext(Nodo n) {
next = n;
}
public Nodo(int[][] s, Nodo n) {
setInfo(s);
setNext(n);
}
public void setInfo(int[][] s) {
System.arraycopy(s, 0, this.s, 0, 9);
//
//

for (int i = 0; i < s.length; i++) {


for (int j = 0; j < s.length; j++) {

//
//

this.s[i][j] = s[i][j];
}

//

}
public int[][] getInfo() {
return this.s;
}
public Nodo getNext() {
return next;
}
}

You might also like