![]() ![]() Realized that the core of the problem is really the turns Karel needs to make while traversing through the checkerboard. Made some progress but the solution started getting increasingly complex.Ģ. Later turn the horizontal line into a checkerboard. Think linearly about Karel dropping beepers alternatively on each move “over a single horizontal line” till the end is reached. Thought that ignoring the checkerboard might lead to a simpler solution. Having said that, here’s my train of thoughts as I was trying to solve the problem:ġ. Otherwise you will be depriving yourself of a cool mental accomplishment. Please don’t look at the solution until you have solved it yourself. Having spent more hours than I am willing to admit, finally solved Karel the Robot Problem 3 (from Assignment 1). Let us cross over the river, and rest under the shade of the trees – General “Stonewall” JacksonĪrchives Archives Subscribe to Blog via Emailįrom the Course Programming Methodology CS 106A Offered at Stanford University.Not Every Time Does the Archer Hit the Target. ![]() ![]() Vimeo on Demand – Show All Episodes Expanded by Default.Developing iOS7 Apps for iPhone and iPad (Fall 2013) by Stanford University.Developing iOS 8 Apps with Swift by Stanford University. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |