IA - Inteligencia Artificial

/*********** Programacion dinamica para obtener el mayor numero de cartas que sumen 15*********
 *********** Modificacion al problema de la mochila */
 
private int W;
private int C;
private int[][] V;
private int[] baza;

private int mochila(){ 
    for(int k = 0; k<=W; k++) V[0][k] = 0;
    
    for(int i = 1; i<=C; i++){
        V[i][0] = 0;
        for(int j = 1 ; j<= W; j++){
            if(i == 1 && (j < baza[i] || j> baza[i]))
                V[i][j] = 0;
            else if(i == 1){
                V[i][j] = 1;
            }else if(i>1){
                if(j<baza[i]) V[i][j] = V[i-1][j];
                else if(j == baza[i]){
                    if(V[i-1][j]>1) V[i][j] = V[i-1][j];
                    else V[i][j] = 1;
                }else{
                    if(V[i-1][j]==0 && V[i-1][j-baza[i]]==0) V[i][j] = 0;
                    else if(V[i-1][j]< V[i-1][j-baza[i]]+1) V[i][j] = V[i-1][j-baza[i]] + 1;
                    else V[i][j] = V[i-1][j];
                }
            }
        }
    }
    return V[C][W];    
    
 }/*Tiempo de ejecucion: T(C,W) = c1*C*W + c2*C pertenece O(C*W) */

private void getSolucion(int[] A, int i, int j, int n){
    if(i> 0 && j > 0 && n>=0){
        if(V[i][j] == V[i-1][j])
            getSolucion(A, i-1, j, n);
        else{
            getSolucion(A,i-1,j-baza[i], n-1);
            A[n] = i-1;
        }
    }
 }