Gaming is a hard job, but someone has to do it!.pdf

Gaming is a hard job, but someone has to do it!.pdf

ID:33874902

大小:332.48 KB

页数:12页

时间:2019-03-01

Gaming is a hard job, but someone has to do it!.pdf_第1页
Gaming is a hard job, but someone has to do it!.pdf_第2页
Gaming is a hard job, but someone has to do it!.pdf_第3页
Gaming is a hard job, but someone has to do it!.pdf_第4页
Gaming is a hard job, but someone has to do it!.pdf_第5页
资源描述:

《Gaming is a hard job, but someone has to do it!.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Gamingisahardjob,butsomeonehastodoit!GiovanniVigliettaUniversityofPisa,Italy,viglietta@gmail.comAbstract.Weestablishsomegeneralschemesrelatingthecomputa-tionalcomplexityofavideogametothepresenceofcertaincommonele-mentsormechanics,suchasdestroyablepaths,collectingitems,doorsac-t

2、ivatedbyswitchesorpressureplates,etc..Thenweapplysuchmetathe-orems"toseveralvideogamespublishedbetween1980and1998,includ-ingPac-Man,Tron,LodeRunner,BoulderDash,De ektor,Mindbender,PipeMania,Skweek,PrinceofPersia,Lemmings,Doom,PuzzleBob-ble3,andStarcraft.Weobtainbothnewresults,

3、andimprovementsoralternativeproofsofpreviouslyknownresults.1IntroductionThisworkwasinspiredmainlybytherecentpapersonthecomputationalcomplexityofvideogamesbyForisek[4]andCormode[2],alongwiththeexcellentsurveysonthetopicbyKendalletal.[6]andDemaineetal.[3],andmayberegardedastheir

4、continuationonthesamelineofresearch.Ourpurposeistosingleoutcertainrecurringfeaturesormechanicsinavideogamethatenablegeneralreductionschemesfromknownhardproblemstothegamesweareconsidering.Tothisend,inSection2wepro-duceseveralmetatheoremsthatwillbeappliedinSection3toawealthoffamo

5、uscommercialvideogames,inordertoautomaticallyestablishtheirhardnesswithrespecttocertaincomputationalcomplexityclasses(withacoupleofexceptions).BecausemostrecentcommercialgamesincorporateTuring-equivalentscriptinglanguagesthateasilyallowtode-signundecidablepuzzlesaspartofthegame

6、play,wewillfocusprimarilyarXiv:1201.4995v1[cs.GT]24Jan2012onolder,scriptless"games.Ourselectionincludesgamespublishedbe-tween1980and1998,presentedinalphabeticalorderforbetterreference.Duetospacelimitations,noteverygameisproperlyintroduced,butourconstructionsshouldbepromptlyund

7、erstoodbyanycasualplayer.Severalopenproblemsremain:Wheneveronlythehardnessofagameisprovedwithrespecttosomecomplexityclass,theobviouslyimpliedquestioniswhetherthegameisalsocompleteforthatclass.Di erentvariantsofeachgamemaybestudied,obtainedforinstancebyfurtherrestrictingthesetof

8、gameelementsusedinourhardnessproofs.Thereaderisassumed

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

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

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