汉诺塔c源程序实现和讲解.pptVIP

汉诺塔C源程序实现及讲解; 汉诺塔;一、汉诺塔游戏简介及其玩法 ;3操作指南：在挂有圆盘的柱子上方点击向上按钮‘ W ’ 或者‘ UPDOWN’按键选中圆盘，按左右移动键移动到相对应的柱子上方，按向下键放下圆盘，至此完成一次圆盘移动。;二、设计思路及程序设计流程;例如最简单的三阶汉诺塔移动方法： A→C,A→B,C→B,A→C,B→A,B→C,A→C 2 程序设计流程图： ;;三、源程序及其讲解;3. 主要程序分析;struct rod { int nDisk[10][5]; int nDiskName[10]; }tree[3]; /********************************************/ ntoa(int s) { int b[15]; int i,j; for (i=0;i15;i++) chMark[i]=\0; for (i=0;s=10;i++) {b[i]=s%10; s/=10;} b[i]=s; for(j=i;j=0;j--) chMark[i-j]=b[j]+0; } void INITIAL() /**GAME INITIAL**/ { int gd=DETECT,gm=0; initgraph(gd,gm,); setbkcolor(0); } ;void FLASH_REC() { int NUM,x1=8,x2=10; randomize(); for(NUM=0;NUM33;NUM++) { F(1,rand()%16); B(x1,412,x2,414); x1=x1+20; x2=x2+20; } } void DrawRod() { F(1,3); B(120,152,124,402); /*ROD1*/ B(320,152,324,402); /*ROD2*/ B(520,152,523,402); /*ROD3*/ F(6,LIGHTBLUE); B(119,151,123,401); B(319,151,323,401); B(519,151,522,401); } ;void ShowInfo(int nRn,int nWhetherGetDisk) { F(1,8); B(230,418,620,428); settextstyle(DEFAULT_FONT,HORIZ_DIR,1); S(CYAN); if(nRn==0nWhetherGetDisk==0) O(235,419,YOU NOW AT THE FIRST ROD); else if(nRn==1nWhetherGetDisk==0) O(235,419,YOU NOW AT THE SECOND ROD); else if(nRn==2nWhetherGetDisk==0) O(235,419,YOU NOW AT THE THIRD ROD); else if(nWhetherGetDisk==1) {S(YELLOW); switch(nRn) {case 0 :O(235,419,YOU GET THE TOP DISK AT THE FIRST ROD);break; case 1 :O(235,419,YOU GET THE TOP DISK AT THE SECOND ROD);break; case 2 :O(235,419,YOU GET THE TOP DISK AT THE THIRD ROD);break; default:break; } } else if(nRn==3nWhetherGetDisk==nBaseNum) {S(WHITE);O(235,419,YOU SHOULD DO YOUR BEST);} else if(nRn==3nWhetherGetDisk==nBaseNum*2) O(235,419,YOU SEEMS PLAY NOT VERY GOOD...^_^); else if(nRn==4nWhetherGetDisk==0) {S(13);O(235,419,O.K YOU HAVE FINISHED YOURWORK);sleep(1);} else O(235,419,YOU HAVE GET DOWN THE DISK); } ;void ShowRecord() {