mitocw 13广度优先有哪些信誉好的足球投注网站bfstranscripts字幕誊写.pdfVIP

MITOCW|13.Breadth-FirstSearch(BFS)

ThefollowingcontentisprovidedunderaCreativeCommonslicense.Yoursupport

willhelpMITOpenCourseWarecontinuetoofferhighqualityeducationalresources

forfree.TomakeadonationorviewadditionalmaterialsfromhundredsofMIT

courses,visitMITOpenCourseWareatocw.mit.edu.

PROFESSOR:Todayweregoingtointroducegraphsearchingeneralandtalkaboutone

algorithm,whichisbreadth-firstsearch,andunderstandhowinprincipleyoucan

solveapuzzleliketheRubiksCube.SobeforeIgettoRubiksCubesletmeremind

youofsomebasicstuffaboutgraphs.OrIcantellyoutostartoutwith,graph

searchisaboutexploringagraph.Andtheresmanydifferentnotionsofexploringa

graph.

MaybeIgiveyousomenodeinagraph,s,andsomeothernodeinagraph,t,and

IdliketofindapaththatsgoingtorepresentaproblemlikeIgiveyouaparticular

stateofaRubiksCubeandIwanttoknowistheresomepaththatgetsmeintoa

solvedstate?DoIreallywanttosolvethisonstage?Whatthehell?Westarted.So

thisisaparticularlyeasystatetosolve,whichiswhyIsetupthisway.,so

thereyougo.SevenbysevenbysevenRubiksCubesolvedin10seconds.

Amazing.Newworldrecord.

SoyouregivensomeinitialstateoftheRubiksCube.Youregiventhetargetsthat

youknowwhatsolvedlookslike.Youwanttofindthispath.Maybeyouwanttofind

allpathsfroms.Maybeyoujustwanttoexploreallthenodesinagraphyoucan

reachfroms.Maybeyou