騎士游戲設(shè)計

1、-作者xxxx-日期xxxx騎士游戲設(shè)計【精品文檔】/*qishi */#include <stdio.h>#include <conio.h>struct memoryint sence88 ; int board88 ; int mem8 ; int last ; mem64 ;int h8=2,1,-1,-2,-2,-1,1,2 ;int v8=-1,-2,-2,-1,1,2,2,1 ;int board88=0 ;int sence88=2,3,4,4,4,4,3,2, 3,4,6,6,6,6,4,3, 4,6,8,8,8,8,6,4, 4,6,8,8,8,8,

2、6,4, 4,6,8,8,8,8,6,4, 4,6,8,8,8,8,6,4, 3,4,6,6,6,6,4,3, 2,3,4,4,4,4,3,2 ;int row, col,hty=0 ;int comeon(void) ;void goback(void) ;int findmin(int) ;void savemem(int) ;void altsence(void) ;void print() ;void printmem(int) ;/* PREPARE */void prepare(void)int i, j, ha8,va8 ; for(i=0; i<64; i+) memi.

3、last=-1 ; for(j=0; j<8; j+) memi.memj=0 ; printf("Input Begin Point :n") ; scanf("%d%d",row,col) ; boardrowcol=1 ; for(i=0; i<8; i+) hai=row + hi ; vai=col + vi ; if( hai>=0 && hai<=7 && vai>=0 && vai<=7 ) sencehai>vai>- ; savemem(0

4、) ; /*print(hty) ; */ hty+ ;/* COMEON! */int comeon(void)int i, ha8, va8, b8=9,9,9,9,9,9,9,9, info=0 ; for(i=0; i<8; i+) hai=row+hi ; vai=col+vi ; if( hai>=0 && hai<=7 && vai>=0 && vai<=7 ) if( boardhai>vai>=0 && memhty.memi!=1 ) bi=sencehai>va

5、i> ; i=findmin(b) ; if( bi!=9 ) ; row=hai ; col=vai ; boardhai>vai>=1 ; altsence() ; savemem(i) ; /*printmem(hty) ; */ hty+ ; info=1 ; return (info) ;/* GOBACK */void goback(void)int i,j ; hty-; boardrowcol=0 ; row = row - hmemhty.last ; col = col - vmemhty.last ; memhty.memmemhty+1.last =

6、1 ; for(i=0; i<8; i+) for(j=0; j<8; j+) senceij=memhty.senceij ;/* PRINT */void print(void)int i; for(i=0; i<64; i+) clrscr(); printmem(i) ; getchar() ; /* PRINTMEM */void printmem(int ht)int i, j; printf("No.%d Step;n",ht) ; for(i=0; i<8; i+) for(j=0; j<8; j+) if( memht.boa

7、rdij=0) printf("O ") ; else printf("H ") ; printf("n") ; /* ALTSENCE */void altsence(void)int i, ha8, va8 ; for(i=0; i<8; i+) hai=row + hi ; vai=col + vi ; if( hai>=0 && hai<=7 && vai>=0 && vai<=7 ) sencehai>vai>- ; /* SAVEME

8、M */void savemem(int lt)int i,j ; memhty.last=lt ; for(i=0; i<8; i+) for(j=0; j<8; j+) memhty.senceij = senceij ; memhty.boardij = boardij ; /* FINDMIN */int findmin(int c8)int i,j=0 ; for(i=0; i<8; i+) if( ci < cj ) j=i ; return (j) ;/* MAIN */main()int i; prepare() ; i=comeon(); while(

9、 hty<64 ) if(i) i=comeon() ; else goback() ; i=1; print(); /* 8 queen */#include <stdio.h>int col8 , temp=0 ;void qu(int n) int pan(int) ; void pri(void) ; int t; if(n=0) t=4 ; else t=8 ; for(coln=0; coln<t; coln+ ) if(pan(n) continue ; if (n!=7) qu(n+1); else pri() ; void pri(void)int i, j;for (i=0; i<8; i+) for (j=0; j<8; j+) if( coli=j ) printf("Q ") ; else printf("X ") ; printf("n") ; temp+ ;printf("n%dn",temp) ;getchar();int pan(int t) int i,n=0 ; for(i=0; i<t; i+) if (coli=colt) n=1; break; if( (col