商人过河c语言编程,Óõݹ鷨½â¾öÉÌÈ˶ɺÓÎÊÌâ

×÷Õߣº²Ü¿ªÈñ

µÝ¹éȷʵÊÇÒ»ÖÖºÜÁ˲»ÆðµÄ·½·¨£¬µ«ÊÇÎҸоõʵÔÚÊÇÌ«ÄÑ°ÑÎÕÁË£¬µÝ¹é·¨¿ÉÒÔÓÃջת»»³ÉΪ·ÇµÝ¹é·¨£¬µ«Êǵݹ鷨¿ÉÒÔʹ³ÌÐò¼òµ¥£¬Óõݹ鷨½â¾öµÄn»ÊºóÎÊÌ⣬»¹ÓкºÅµËþÎÊÌ⣬ÃÔ¹¬ÎÊÌâ¡£¡£¡£¡£¡£¡£

ÉÌÈ˶ɺÓÎÊÌâÊÇÕâÑùµÄ£ºÓÐÈý¸öÉÌÈË£¬Èý¸öÇ¿µÁ£¬ºÍÒ»Ìõ´¬£¨´¬Ã¿´ÎÖ»¿ÉÒÔÔØСÓÚµÈÓÚÁ½¸öÈË£©ËûÃÇͬÔÚºÓµÄÒ»±ß£¬Ïë¶É¹ýºÓÈ¥£¬µ«ÊDZØÐë±£Ö¤ÔÚºÓµÄÈκÎÒ»±ß±ØÐë±£Ö¤ÉÌÈ˵ÄÊýÄ¿´óÓÚµÈÓÚÇ¿µÁµÄÊýÄ¿£¬Ó¦¸ÃÔõô¹ýÕâÌõºÓÄØ£¿

ÓõݹéµÄÔ´³ÌÐòÈçÏ£º

¿ªÊ¼Ê±ÉÌÈË£¬Ç¿µÁËùÔڵĺӵÄÕâ±ßÉèΪ0״̬£¬ÁíÒ»±ßÉèΪ1״̬£¨Ò²¾ÍÊÇ´¬¿ªÊ¼Ê±µÄÒ»±ßÉèΪ0£¬µ±´¬Ê»µ½¶Ô°¶ÊÇÉèΪ1״̬£¬ÔÚÕâÁ½¸ö״̬ʱ£¬¶¼±ØÐë·ûºÏÌõ¼þ£©

#include

struct node                        /*½¨Á¢Ò»¸öÀàËÆÕ»µÄÊý¾Ý½á¹¹²¢ÇÒ¿ÉÒÔä¯ÀÀÿһ¸öÊý¾Ýµã*/

{

int x;

int y;

int state;

struct node *next;

};

typedef struct node state;

typedef state *link;

link PPointer1=NULL;

link PPointer2=NULL;

int a1,b1;

int a2,b2;

/*Õ»ÖÐÿ¸öÊý¾Ý¶¼·ÖΪ0£¬1״̬*/

void Push(int a,int b,int n)

{

link newnode;

newnode=(link)malloc(sizeof(state));

newnode->x=a;

newnode->y=b;

newnode->state=n;

newnode->next=NULL;

if(PPointer1==NULL)

{

PPointer1=newnode;

PPointer2=newnode;

}

else

{

PPointer2->next=newnode;

PPointer2=newnode;

}

}

void Pop()                            /*µ¯Õ»*/

{

link pointer;

if(PPointer1==PPointer2)

{

free(PPointer1);

PPointer1=NULL;

PPointer2=NULL;

}

pointer=PPointer1;

while(pointer->next!=PPointer2)

pointer=pointer->next;

free(PPointer2);

PPointer2=pointer;

PPointer2->next=NULL;

}

int history(int a,int b,int n)              /*±È½ÏÊäÈëµÄÊý¾ÝºÍÕ»ÖÐÊÇ·ñÓÐÖظ´µÄ*/

{

link pointer;

if(PPointer1==NULL)

return 1;

else

{

pointer=PPointer1;

while(pointer!=NULL)

{

if(pointer->x==a&&pointer->y==b&&pointer->state==n)

return 0;

pointer=pointer->next;

}

return 1;

}

}

int judge(int a,int b,int c,int d,int n)      /*Åж¨Õâ¸ö״̬ÊÇ·ñ¿ÉÐУ¬ÆäÖÐʹÓÃÁËhistoryº¯Êý*/

{

if(history(a,b,n)==0) return 0;

if(a>=0&&b>=0&&a<=3&&b<=3&&c>=0&&d>=0&&c<=3&&d<=3&&a+c==3&&b+d==3)

{

switch(n)

{

case 1:

{

if(a==3)

{

Push(a,b,n);

return 1;

}

else if(a==0)

{

Push(a,b,n);

return 1;

}

else if(a==b)

{

Push(a,b,n);

return 1;

}

else return 0;

}

case 0:

{

if(a==3)

{

Push(a,b,n);

return 1;

}

else if(a==0)

{

Push(a,b,n);

return 1;

}

else if(a>=b)

{

Push(a,b,n);

return 1;

}

else return 0;

}

}

}

else return 0;

}

int Duhe(int a,int b,int n)               /*µÝ¹é·¨½â¾öÉÌÈ˶ɺÓÎÊÌ⣬¼ÙÈçÕâÒ»¸ö״̬·ûºÏ*/

{                                         /*ÔòÅж¨ÏÂÒ»¸ö״̬£¬Ö±ÖÁÎÊÌâ½â¾ö*/

if(a==0&&b==0)  return 1;

if(n==0)                                /*Åж¨0״̬ʱ£¬ÉÌ·Ë״̬ÊÇ·ñ·ûºÏÒªÇó*/

{

if(judge(a-1,b-1,4-a,4-b,1))

{

if(Duhe(a-1,b-1,1)==1)

return 1;

}

if(judge(a,b-2,3-a,5-b,1))

{

if(Duhe(a,b-2,1)==1)

return 1;

}

if(judge(a-2,b,5-a,3-b,1))

{

if(Duhe(a-2,b,1)==1)

return 1;

}

if(judge(a-1,b,4-a,3-b,1))

{

if(Duhe(a-1,b,1)==1)

return 1;

}

if(judge(a,b-1,3-a,4-b,1))

{

if(Duhe(a,b-1,1)==1)

return 1;

}

else

{

Pop(0);

return 0;

}

}

if(n==1)                              /*Åж¨0״̬ʱ£¬ÉÌ·Ë״̬ÊÇ·ñ·ûºÏÒªÇó*/

{

if(judge(a+1,b+1,2-a,2-b,0))

{

if(Duhe(a+1,b+1,0)==1)

return 1;

}

if(judge(a,b+2,3-a,1-b,0))

{

if(Duhe(a,b+2,0)==1)

return 1;

}

if(judge(a+2,b,1-a,3-b,0))

{

if(Duhe(a+2,b,0)==1)

return 1;

}

if(judge(a+1,b,2-a,3-b,0))

{

if(Duhe(a+1,b,0)==1)

return 1;

}

if(judge(a,b+1,3-a,2-b,0))

{

if(Duhe(a,b+1,0)==1)

return 1;

}

else

{

Pop(1);

return 0;

}

}

return 0;

}

main()

{

link pointer;

Push(3,3,0);

Duhe(3,3,0);

pointer=PPointer1;

while(pointer!=NULL)

{

printf("%d,%d---%d\n",pointer->x,pointer->y,pointer->state);

pointer=pointer->next;

}

getch();

}