search

helenchan01 / semicolons

0 stars 0 forks source link

statement + recursive abstraction constructive critism #2

Open ghost opened 6 years ago

ghost commented 6 years ago

statement

Speaking from personal experience, stating more rules that your algorithm must follow can help ease programming. for example try to answer: what will your program do to determine the boolean? What rules must the explorer follow (ex. turns, legal movement)?

recursive abstraction

I concur with Mr. Holmes' reasoning that going by junctions isn't the best way to approach this problem. Focusing on stepping stones is definitely the way to go! I have also found that thinking of the recursive case as "n-1" problems isn't particularly helpful when it comes to backtracking. Try draw it out, that's what helped me and Jack!

helenchan01 commented 6 years ago

I completely agree with you. We thought about it after looking at Holmes suggestion and realized our initial methods would just complicate things. Our recursive abstraction is now updated to use stepping stones. Thanks for sharing your insight!