So, umsothat's what I'd liketodonow, Um, a coupleofthingslikeSo, forexample, um, it's a littlechallengingtoforthebitelikethe, butneveractuallyknowswhenthegameisoverbecauseofthewayHalitissetup.
Andit's kindofunfortunate, butwecanknowinadvancehowmanyturnstherewillbegiven a gamesize.
So, forexample, letmejustzoomin a littlebithere.
I guesswhat I'lldois I'lljustmakebecauselaterwecouldquerysothebodycanquerythegamemapandthenwecangetthesizeofthegamemap, whichwillalwaysbesquare.
Andthenwhatwecandoishavesomesortofvariableherecalledlikemaps, settingsthatwillbe a dictionary.
Andthenlet's saythemapis a 32 by 32.
Thatmeansthere's goingtobe 400 turns.
Thenwecouldjustcontinuethis.
Soat 40 40 by 40 thatmeansit's gonnabe 425.
Wehave a 48 groups, not 49 48 whichisgonnabe a 4 50 Wow, I can't type.
I hopethisdoesn't turnoutlikeyesterday's videos.
Anyways, 56 becomes a 475 andfinally 64 is 500 turns.
Sowecouldquerythegamemapandwecanknow.
Okay, howmanyturnsairthereThisway.
Onthelastturn, wecouldqueryandsayhowmuch I like, Dowehave?
And I thinkinsteadprobablyeventuallywillgothatrouteand, like, justgobasedonahthresholdofpercentcollectedratherthanhowlightcollectedbecausethatmightwindupconfusing a model.
Butfornow, what I'd liketodioiscontinueonthistrekthatwe'vegotgoingon.
Soifweallowthistogofor 500 freakinturns, theresultsareprobablyit's gonnabealmostuntradeablecausethelittlekernelofwhatthe A I didgoodduring 500 turnsisgoingtobeobstructedbyinsaneamountsofnoise.
Okay, sonowwhatwewanttodoiswewillalsoratherthan n p dotsave.
Ah, here.
What I'd liketodois I'm gonnacommentthatout.
We'reinit.
Comeoverhereandlet's make a newdirectory.
And I'm gonnacallthisnotinallcaps.
I'm gonnacallthistrainingUnderscoreddata.
Sothisiswhereallourtrainingdateisgoingtogo.
Ifwemeet a certainthreshold, I'm gonnathrowanotherifstatementdownhereandwanttosayifgamedotturnnumberequals, umwhatwasthething?
Mac, uh, turnstotalturns?
That's gottobeit.
TotalturnsumSoifthat's thecase, okay, soifweareonthefinalturn, becauseagain R A I doesnotgetinformationfromthegamethatthegameisover, sowehavenowayofknowing, butwedohave a wayofknowingwhatisthefinalturn.
Andthenwecankindofsurmise.
Okay, Okay, it's theendofthegame.
So?
So, ifgamedotturnnumberequalsthetotalturns, whatdowewanttodo?
Soatsomepoint, um, like, I wouldjustleavethisrunninglikeovernightallday.
Whatever.
RunMorgainesimultaneously, howevermanyyoucando.
Um, I would, butthiskindof a CPUhog, umanyway, run a bunchofthese.
Gather a bunchoftrainingsamplesabout 2000.
Hopefullywecangetabout 2000 samples.
Um, youknowabove.
Like I don't know, 424,300.
I'd beprettynice.
Lookatthisguy.
Almost 5000 ismovingrandomly.
It's oneshipin 50 turns.
1000?
Howlight?
Thatisawesome.
Okay, uh, anyway, so I wouldlettheserunfor a while, and I think I'm gonnastopithereandthenpickupinthenexttutorialwherewewilltakethebestofthebesttrainingmodel.
SoSo I wasreallylookingoverallthisstuff, and I realized, um, I'vemadeanegregiousmistake, andwhatwe'vedoneisbasicallywe'rejustWe'vemade a coupleofmistakes.
And I waslike, Oh, mygosh, I don't think I waslike, I rememberedthat I probablysavedhissurroundingsratherthanactuallybuiltthetrainingdatawithtargetsandallofit, uh, itwasquitetheheartsinkingmoment.