JAVASCRIPT 版本A×寻路算法.docxVIP

? 说到做游戏，必不可少的需要用到寻路算法，一般游戏里的寻路算法大多数都以A*算法为主，这里也就实现了js里采用a*寻路的程序。?????当然，这个寻路算法也不是最优化的，像幻宇开发的“交点寻径法”也是个中精品，两者可谓各有千秋，只是如果地图很大的情况下，我们会惊讶于“交点寻径法”的迅速。htmlheadtitleuse A* to find path.../title/headbody style=margin:0pxscript/*written by 百晓生email:jsrpg@126.comqq:156809986msn:jscript_rpg@*/varcloselist=new Array(),openlist=new Array();vargw=10,gh=10,gwh=14;varp_start=new Array(2),p_end=new Array(2);vars_path,n_path=;varnum,bg,flag=0;var w=32,h=32;function GetRound(pos){? var a=new Array();? a[0]=(pos[0]+1)+,+(pos[1]-1);? a[1]=(pos[0]+1)+,+pos[1];? a[2]=(pos[0]+1)+,+(pos[1]+1);? a[3]=pos[0]+,+(pos[1]+1);? a[4]=(pos[0]-1)+,+(pos[1]+1);? a[5]=(pos[0]-1)+,+pos[1];? a[6]=(pos[0]-1)+,+(pos[1]-1);? a[7]=pos[0]+,+(pos[1]-1);? return a;}function GetF(arr){? vart,G,H,F;? for(vari=0;iarr.length;i++){??? t=arr[i].split(,);??? t[0]=parseInt(t[0]);t[1]=parseInt(t[1]);??? if(IsOutScreen([t[0],t[1]])||IsPass(arr[i])||InClose([t[0],t[1]])||IsStart([t[0],t[1]])||!IsInTurn([t[0],t[1]]))??????? continue;??? if((t[0]-s_path[3][0])*(t[1]-s_path[3][1])!=0)??????? G=s_path[1]+gwh;??? else??????? G=s_path[1]+gw;??? if(InOpen([t[0],t[1]])){??????? if(Gopenlist[num][1]){????????? openlist[num][0]=(G+openlist[num][2]);????????? openlist[num][1]=G;????????? openlist[num][4]=s_path[3];??????? }??????? else{G=openlist[num][1];}??? }??? else{??????? H=(Math.abs(p_end[0]-t[0])+Math.abs(p_end[1]-t[1]))*gw;??????? F=G+H;??????? arr[i]=new Array();??????? arr[i][0]=F;arr[i][1]=G;arr[i][2]=H;arr[i][3]=[t[0],t[1]];arr[i][4]=s_path[3];??????? openlist[openlist.length]=arr[i];??? }??? if(maptt.rows[t[1]].cells[t[0]].style.backgroundColor!=#ccccccmaptt.rows[t[1]].cells[t[0]].style.backgroundColor!=#0000ffmaptt.rows[t[1]].cells[t[0]].style.backgroundColor!=#ff0000maptt.rows[t[1]].cells[t[0]].style.backgroundColor!=#00ff00)??? {??????? maptt.rows[t[1]].cells[t[0]].style.backgroundColor=#FF00FF;??????? //maptt.rows[t[1]].cells[t[0]].innerHTML=font color=white+G+/font;??? }? }}function IsStart(arr){? if(arr[0]==p_star