0001 #include "queen_brute_force_1/queen.h"
0002 
0003 void place5Queens() { //5皇后剪枝算法
0004    int solu[5]; //解法
0005    for ( solu[0] = 0; solu[0] < 5; solu[0]++ )
0006       if ( !collide ( solu, 0 ) )
0007          for ( solu[1] = 0; solu[1] < 5; solu[1]++ )
0008             if ( !collide ( solu, 1 ) )
0009                for ( solu[2] = 0; solu[2] < 5; solu[2]++ )
0010                   if ( !collide ( solu, 2 ) )
0011                      for ( solu[3] = 0; solu[3] < 5; solu[3]++ )
0012                         if ( !collide ( solu, 3 ) )
0013                            for ( solu[4] = 0; solu[4] < 5; solu[4]++ )
0014                               if ( !collide ( solu, 4 ) ) {
0015                                  nSolu++; displaySolution ( solu, 5 );
0016                               }
0017 }