https://hieuphay.com/tags/dynamic-optimization/Recent content in Dynamic Optimization on Hieu PhayHugoenNguyen Duc HieuNguyen Duc HieuWed, 15 Dec 2021 00:00:00 +0000https://hieuphay.com/AoC2021-day15/Wed, 15 Dec 2021 00:00:00 +0000https://hieuphay.com/AoC2021-day15/<div class="ox-hugo-toc toc"> <div></div> <div class="heading">Table of Contents</div> <ul> <li><a href="https://hieuphay.com/AoC2021-day15/#part-1">Part 1</a></li> <li><a href="https://hieuphay.com/AoC2021-day15/#part-2">Part 2</a></li> </ul> </div> <!--endtoc--> <p>The one today is difficult but fun! It provided a very nice example for dynamic programming. I would probably revisit this puzzle again if I have the time.</p> <h2 id="part-1"> Part 1 <a class="heading-link" href="#part-1" aria-labelledby="part-1"> <i class="fa fa-link" aria-hidden="true"></i> </a> </h2> <details> <summary> Show challenge - day 15, part 1 </summary> <div class="details"> <p>You&rsquo;ve almost reached the exit of the cave, but the walls are getting closer together. Your submarine can barely still fit, though; the main problem is that the walls of the cave are covered in <a href="https://en.wikipedia.org/wiki/Chiton">chitons</a>, and it would be best not to bump any of them.</p>