knighttour骑士周游试探法(骑士旅游骑士周游试探法)

knighttour骑士周游试探法(骑士旅游骑士周游试探法)

ID:30769655

大小:66.50 KB

页数:11页

时间:2019-01-03

knighttour骑士周游试探法(骑士旅游骑士周游试探法)_第1页
knighttour骑士周游试探法(骑士旅游骑士周游试探法)_第2页
knighttour骑士周游试探法(骑士旅游骑士周游试探法)_第3页
knighttour骑士周游试探法(骑士旅游骑士周游试探法)_第4页
knighttour骑士周游试探法(骑士旅游骑士周游试探法)_第5页
资源描述:

《knighttour骑士周游试探法(骑士旅游骑士周游试探法)》由会员上传分享,免费在线阅读,更多相关内容在工程资料-天天文库

1、knighttour骑士周游试探法(骑士旅游骑士周游试探法)Inchess,therider,smovinglinesareLshaped(twoinonedirectionandoneintheverticaldirection)・TheKnightstourproblemisthatthechesspieces,calledknights,marchonanemptychessboard,Canyouwalkoneachofthesquaresofthe64squaresandgoonlyonce?A)representsachessboardwithatwo-dimen

2、sionalarrayofboard,eachofwhichisinitializedto08X8.8possiblemovingpathsaredescribedbasedonthehorizontalandverticalcomponentsofthemovement・Horizontal,vertical,andverticalmovementsarerepresentedbynegativenumbers,representedbytwoone-dimensionalarrays,horizontalandvertical:Horizontal[0.二2Horizon

3、tal[1_=1Horizontal[2_二-1Horizontsl[3_二-2Horizontsl[4.二-2Horizontal[5_二-1Horizontal[6.二1Horizontal[7.二2VerticalLO.二-1Vertical=-2Vertical2=-2Vertical3=-1Vertical4二1Vertical[5[二2Vertical[6[二2Vertical7二1ThevariablescurrentRowandcurrentColumnrepresenttherowsandcolumnsoftheknight,scurrentposition

4、.InordertoperformamoveNumbertypemovement(wheremoveNumberisbetween0and7),theprogramshouldusethefollowingstatement:CurrentRow二vertical[moveNumber];CurrentColumn二horizontal[moveNumber];Defineacounterthatchangesfrom1~64.Recordsthenearestcountofknightsmovingineachgrid・Totesteachpossiblemovementt

5、odeterminewhethertheknighthasvisitedthebox,ofcourse,alsodetecteachpossiblemovementtomakesurethattheriderdoesnotrunoutsidethechessboard・Nowwriteaprogramtoseehowmanytimestheknighthasmoved(b)developaheuristic(orstrategy)fortheknight,smovements・Trialanderrordonotalwaysguaranteesuccess,butanelab

6、oratetrialwillgreatlyincreaseyourchancesofsuccess.Youmayhavenoticedthatoutsidesquaresaremoretroublesomethansquaresnearthecenteroftheboard・Infact,themosttroublesomeorinaccessiblesquaresarefourcorners・Themostintuitiveideaisthatyoushouldmovetheknighttothemostinaccessiblesquaresandemptythemosta

7、ccessibleonessothatwhenthechessboardbecomescrowdedneartheendofthetour,thechancesofsuccessaregreater・Developareachabilitytest,classifythemaccordingtothereachableextentofeachgrid,andalwaysmovetheknighttothemostdifficultboxtoreach(tomatchtheknight,sLshapemo

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。