[Dev-C++] reg-Knight's tour problem

[Mohammed R. <p_m...@ho...>]

hey,
I had a look at the code sent in. Am new to programming, my code sux when 
compared to that. :D .If any one of you cud fix this code ,help me
out.
-Riyaz

#include <iostream.h>
#include <stdlib.h>
#include <process.h>
class knight
     {
     int chess[8][8],location[65][10],denied[64];
     int row_loc,pos,i,j;
     public:
     knight();
     void assignment(void);
     int value(int);
     void refresh(void);
     int append(int ,int);
     };
knight::knight(void)
     {
     row_loc=-1;
     i=j=0;
     for(int m=0;m<8;m++)
          for(int n=0;n<8;n++)
               chess[m][n]=0;
     for(int m=0;m<65;m++)
          for(int n=0;n<10;n++)
               location[m][n]=0;
     for(int m=0;m<64;m++)
          denied[m]=99;
     assignment();
     }
void knight::assignment(void)
     {
     chess[i][j]=1;
     refresh();
     pos=value(j+(8*i));
     i=pos/8;
     j=pos%8;
     assignment();
     }
int knight::value(int val)
     {
     row_loc++;
     int temp=1;
     int lock,ii,jj;
     location[row_loc][0]=val;
     ii=val/8;
     jj=val%8;
     if(jj==0)
          {
          if(ii>=1)
               {
               if(ii>=2)
                    {lock=append(val-15,temp);if(lock==0) {temp++;}}
               lock=append(val-6,temp);if(lock==0) {temp++;}
               }
          if(ii<=6)
               {
               if(ii<=5)
                    {lock=append(val+17,temp);if(lock==0) {temp++;}}
               lock=append(val+10,temp);if(lock==0) {temp++;}
               }
          }
     if(jj==7)
          {
          if(ii>=1)
               {
               if(ii>=2)
                    {lock=append(val-17,temp);if(lock==0) {temp++;}}
               lock=append(val-10,temp);if(lock==0) {temp++;}
               }
          if(ii<=6)
               {
               if(ii<=5)
                    {lock=append(val+15,temp);if(lock==0) {temp++;}}
               lock=append(val+6,temp);if(lock==0) {temp++;}
               }
          }
     if(jj==1)
          {
          if(ii>=1)
               {
               if(ii>=2)
                    {
                    lock=append(val-15,temp);if(lock==0) {temp++;}
                    lock=append(val-17,temp);if(lock==0) {temp++;}
                    }
               lock=append(val-6,temp);if(lock==0) {temp++;}
               }
          if(ii<=6)
               {
               if(ii<=5)
                    {
                    lock=append(val+17,temp);if(lock==0) {temp++;}
                    lock=append(val+15,temp);if(lock==0) {temp++;}
                    }
               lock=append(val+10,temp);if(lock==0) {temp++;}
               }
          }
     if(jj==6)
          {
          if(ii>=1)
               {
               if(ii>=2)
                    {
                    lock=append(val-15,temp);if(lock==0) {temp++;}
                    lock=append(val-17,temp);if(lock==0) {temp++;}
                    }
               lock=append(val-10,temp);if(lock==0) {temp++;}
               }
          if(ii<=6)
               {
               if(ii<=5)
                    {
                    lock=append(val+17,temp);if(lock==0) {temp++;}
                    lock=append(val+15,temp);if(lock==0) {temp++;}
                    }
               lock=append(val+6,temp);if(lock==0) {temp++;}
               }
          }
     if(jj>1 && jj<6)
          {
          if(ii>=1)
               {
               if(ii>=2)
                    {
                    lock=append(val-17,temp);if(lock==0) {temp++;}
                    lock=append(val-15,temp);if(lock==0) {temp++;}
                    }
               lock=append(val-10,temp);if(lock==0) {temp++;}
               lock=append(val-6,temp);if(lock==0) {temp++;}
               }
          if(ii<=6)
               {
               if(ii<=5)
                    {
                    lock=append(val+15,temp);if(lock==0) {temp++;}
                    lock=append(val+17,temp);if(lock==0) {temp++;}
                    }
               lock=append(val+6,temp);if(lock==0) {temp++;}
               lock=append(val+10,temp);if(lock==0) {temp++;}
               }
          }
          lock=append(-1,temp);
          code:
          if(location[row_loc][1]==-1)
               {
               ii=location[row_loc][0]/8;
               jj=location[row_loc][0]%8;
               chess[ii][jj]=0;
               row_loc--;
               if(row_loc<0) {cout<<"NO SOLUTION";system("pause");exit(0);}
               for(int m=1;m<9;m++)
                    location[row_loc][m]=location[row_loc][m+1];
               goto code;
               }
          return location[row_loc][1];
     }
void knight::refresh(void)
     {
     int l,tot;
     l=tot=0;
     for(int m=0;m<64;m++)
          denied[m]=99;
     for(int m=0;m<8;m++)
          {
          for(int n=0;n<8;n++)
               {
               if(chess[m][n]==1)
                    {
                    if(l==63)
                         {
                         cout<<"RESULT :"<<endl;
                         for(int k=0;k<64;k++)
                              cout<<denied[k]<<" ";
                         system("pause");
                         }
                    tot=n+(8*m);
                    denied[l]=tot;
                    l++;
                    }
               }
          }
     }
int knight::append(int val1,int temp1)
     {
     int lock=0;
     for(int m=0;m<64;m++)
          if(denied[m]==val1)
               {lock=1;break;}
     if(!lock)
          location[row_loc][temp1]=val1;
     return lock;
     }
void main()
     {knight k;}



_________________________________________________________________
MSN Photos is the easiest way to share and print your photos: 
http://photos.msn.com/support/worldwide.aspx