问数学Javascript计算

EN

solve();

function solve()
{
    // solutions

    var s =
        [    
            [
                [2,1],[3,2],[4,3],[5,4],[6,5],[7,6],[8,7]
            ],
            [
                [8,1],[7,2],[6,3],[5,4]
            ],
            [
                [3,1],[4,2],[5,3],[6,4],[7,5],[8,6]
            ],
            [
                [6,1],[5,2],[4,3]
            ]
        ];

    // counters

    var i0,i1,i2,i3;

    var n0 = s[0].length,
        n1 = s[1].length,    
        n2 = s[2].length,    
        n3 = s[3].length;    

    // configuration check

    var a,
        found,
        j,
        foundn;

    // check every combination of valid solutions

    foundn = 0;

    for( i0=0; i0<n0; i0++ )
    {
        for( i1=0; i1<n1; i1++ )
        {
            for( i2=0; i2<n2; i2++ )
            {
                for( i3=0; i3<n3; i3++ )
                {
                    // the array a is used to check how many times
                    // each number is used. Item nr. 0 is unused.

                    a = [0,0,0,0,0,0,0,0,0];
                    a[s[0][i0][0]]++;
                    a[s[0][i0][1]]++;
                    a[s[1][i1][0]]++;
                    a[s[1][i1][1]]++;
                    a[s[2][i2][0]]++;
                    a[s[2][i2][1]]++;
                    a[s[3][i3][0]]++;
                    a[s[3][i3][1]]++;
                    found = true;
                    for( j=1; j<=8; j++ )
                    {
                        if( a[j] > 1 )
                        {
                            found = false;
                            break;
                        }
                    }
                    if( found )
                    {
                        console.log( s[0][i0][0] + ' ' +
                                     s[0][i0][1] + ' ' + 
                                     s[1][i1][0] + ' ' + 
                                     s[1][i1][1] + ' ' + 
                                     s[2][i2][0] + ' ' + 
                                     s[2][i2][1] + ' ' + 
                                     s[3][i3][0] + ' ' + 
                                     s[3][i3][1] );
                        foundn++;
                    }
                }    
            }   
        }    
    }

    console.log( 'found ' + foundn + ' configurations' );
}