Thread: Chess horse

Originally Posted by csharp100

Have you done any code yourself? If so, why not post what you have and where your problem lies.

Yes but the matter is that the program is very long compiled about 6 hours and many errors and to eliminate them very long as process there are 6 hours!!

And one more my program is written on C and it is necessary to me to write it on With, but also not badly it to write on C++,

Better on C

Code:

 #include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 64
char enabled[] ="10"; 
char result[5];
char A[5];
char enabled_cnt[] = { 14,50}; 
void generate(char *pos);
void f(int A[N]);
void output(char A[N]);
char B[N];
int right(char *B);
void ris(char *A);


void generate(char *pos)
{ 
  int n; 
  int printflag =  1; 
  *pos = 0; 

  for(n = 0; enabled[n];  n++) { 
    if(enabled_cnt[n]  > 0) { 
        *pos = enabled[n]; 
        enabled_cnt[n]--; 
        generate(pos + 1); 
        enabled_cnt[n]++; 
        printflag = 0; 
    } 
  } 

  if(printflag)
  {

	  if(int g=right(B)) output(B);
	 // printf("%s\n",  result); 
  }

} 

int main()
{
	generate(A);
}


void output(char A[N])
{
	for(int i=0; i<N; i++)
		printf("%c", A[i]);
	printf("\n");
}

void ris(char *A)
{
	for(int i=0; i<64; i++)
		B[i]='0';
	for(int a=0; a<64; a++)
	{
		int i=0, j=0;
		if (A[a]=='1')
		{
			B[a]='!';
			if((a-11)>=0)
			{

				if(B[a-11]!='!') B[a-11]='*';
				if(B[a-9]!='!') B[a-9]='*';
				if(B[a-7]!='!') B[a-7]='*';
				if(B[a-3]!='!') B[a-3]='*';
			}
			else
			{
				if((a-9)>=0)
				{
					if(B[a-9]!='!') B[a-9]='*';
					if(B[a-7]!='!')B[a-7]='*';
					if(B[a-3]!='!') B[a-3]='*';
				}

				else
				{
					if((a-7)>=0)
					{
						if(B[a-7]!='!') B[a-7]='*';
						if(B[a-3]!='!') B[a-3]='*';
					}
					
					else
					{
						if((a-3)>=0)
						if(B[a-3]!='!') B[a-3]='*';
					}
				}
			}


			if((a+11)<=N)
			{
				if(B[a+11]!='!') B[a+11]='*';
				if(B[a+9]!='!') B[a+9]='*';
				if(B[a+7]!='!') B[a+7]='*';
				if(B[a+3]!='!') B[a+3]='*';
			}
			else
			{
				if((a+9)<=N)
				{
					if(B[a+9]!='!') B[a+9]='*';
					if(B[a+7]!='!') B[a+7]='*';
					if(B[a+3]!='!') B[a+3]='*';
				}

				else
				{
					if((a+7)<=N)
					{
						if(B[a+7]!='!') B[a+7]='*';
						if(B[a+3]!='!') B[a+3]='*';
					}
					
					else
					{
						if((a+3)<=N)
						if(B[a+3]!='!') B[a+3]='*';
					}
				}
			}
		}
	}
}

int right(char *B)
{
	ris(A);
	int a=0, b;
	for(int i=0; i<N; i++)
	{
		if (B[i]=='0')
		{
			a++;
		}
		
	} 
	if(a==0) b=1;
	else b=0;
	return b;
}

If it takes 6 hours to compile

I think he meant that it takes 6 hours to execute. He's probably using a brute force approach (though I can't make sense of the code at all), and it's giving bad output for some unknown reason.

I'm not even clear what problem you're trying to solve. Are you trying to do Knight's Tour?

Quzah.

Your solution has a flaw. The knight in the third row, second column, isn't covered by any knights. That means that square isn't able to be attacked. Being on a square in chess doesn't mean that square can be attacked.

Quzah.