<script>!function(){functiont(t){document.documentElement.setAttribute("data-theme",t)}vare=function(){try{returnnewURLSearchParams(window.location.search).get("docusaurus-theme")}catch(t){}}()||function(){try{returnlocalStorage.getItem("theme")}catch(t){}}();t(null!==e?e:"light")}(),function(){try{constc=newURLSearchParams(window.location.search).entries();for(var[t,e]ofc)if(t.startsWith("docusaurus-data-")){vara=t.replace("docusaurus-data-","data-");document.documentElement.setAttribute(a,e)}}catch(t){}}()</script><divid="__docusaurus"><divrole="region"aria-label="Skip to main content"><aclass="skipToContent_fXgn"href="#__docusaurus_skipToContent_fallback">Skip to main content</a></div><navaria-label="Main"class="navbar navbar--fixed-top"><divclass="navbar__inner"><divclass="navbar__items"><buttonaria-label="Toggle navigation bar"aria-expanded="false"class="navbar__toggle clean-btn"type="button"><svgwidth="30"height="30"viewBox="0 0 30 30"aria-hidden="true"><pathstroke="currentColor"stroke-linecap="round"stroke-miterlimit="10"stroke-width="2"d="M4 7h22M4 15h22M4 23h22"></path></svg></button><aclass="navbar__brand"href="/"><bclass="navbar__title text--truncate">mf</b></a><divclass="navbar__item dropdown dropdown--hoverable"><ahref="#"aria-haspopup="true"aria-expanded="false"role="button"class="navbar__link">Additional FI MU materials</a><ulclass="dropdown__menu"><li><aclass="dropdown__link"href="/algorithms/">Algorithms</a></li><li><aaria-current="page"class="dropdown__link dropdown__link--active"href="/c/">C</a></li><li><aclass="dropdown__link"href="/cpp/">C++</a></li></ul></div><aclass="navbar__item navbar__link"href="/contributions/">Contributions</a><aclass="navbar__item navbar__link"href="/talks/">Talks</a></div><divclass="navbar__items navbar__items--right"><aclass="navbar__item navbar__link"href="/blog/">Blog</a><divclass="toggle_vylO colorModeToggle_DEke"><buttonclass="clean-btn toggleButton_gllP toggleButtonDisabled_aARS"type="button"disabled=""title="Switch between dark and light mode (currently light mode)"aria-label="Switch between dark and light mode (currently light mode)"aria-live="polite"><svgviewBox="0 0 24 24"width="24"height="24"class="lightToggleIcon_pyhR"><pathfill="currentColor"d="M12,9c1.65,0,3,1.35,3,3s-1.35,3-3,3s-3-1.35-3-3S10.35,9,12,9 M12,7c-2.76,0-5,2.24-5,5s2.24,5,5,5s5-2.24,5-5 S14.76,7,12,7L12,7z M2,13l2,0c0.55,0,1-0.45,1-1s-0.45-1-1-1l-2,0c-0.55,0-1,0.45-1,1S1.45,13,2,13z M20,13l2,0c0.55,0,1-0.45,1-1 s-0.45-1-1-1l-2,0c-0.55,0-1,0.45-1,1S19.45,13,20,13z M11,2v2c0,0.55,0.45,1,1,1s1-0.45,1-1V2c0-0.55-0.45-1-1-1S11,1.45,11,2z M11,20v2c0,0.55,0.45,1,1,1s1-0.45,1-1v-2c0-0.55-0.45-1-1-1C11.45,19,11,19.45,11,20z M5.99,4.58c-0.39-0.39-1.03-0.39-1.41,0 c-0.39,0.39-0.39,1.03,0,1.41l1.06,1.06c0.39,0.39,1.03,0.39,1.41,0s0.39-1.03,0-1.41L5.99,4.58z M18.36,16.95 c-0.39-0.39-1.03-0.39-1.41,0c-0.39,0.39-0.39,1.03,0,1.41l1.06,1.06c0.39,0.39,1.03,0.39,1.41,0c0.39-0.39,0.39-1.03,0-1.41 L18.36,16.95z M19.42,5.99c0.39-0.39,0.39-1.03,0-1.41c-0.39-0.39-1.03-0.39-1.41,0l-1.06,1.06c-0.39,0.39-0.39,1.03,0,1.41 s1.03,0.39,1.41,0L19.42,5.99z M7.05,18.36c0.39-0.39,0.39-1.03,0-1.41c-0.39-0.39-1.03-0.39-1.41,0l-1.06,1.06 c-0.39,0.39-0.39,1.03,0,1.41s1.03,0.39,1.41,0L7.05,18.36z"></path></svg><svgviewBox="0 0 24 24"width="24"height="24"class="darkToggleIcon_wfgR"><pathfill="currentColor"d="M9.37,5.51C9.19,6.15,9.1,6.82,9.1,7.5c0,4.08,3.32,7.4,7.4,7.4c0.68,0,1.35-0.09,1.99-0.27C17.45,17.19,14.93,19,12,19 c-3.86,0-7-3.14-7-7C5,9.07,6.81,6.55,9.37,5.51z M12,3c-4.97,0-9,4.03-9,9s4.03,9,9,9s9-4.03,9-9c0-0.46-0.04-0.92-0.1-1.36 c-0.98,1.37-2.58,2.26-4.4,2.26c-2.98,0-5.4-2.42-5.4-5.4c0-1.81,0.89-3.42,2.26-4.4C12.92,3.04,12.46,3,12,3L12,3z"></path></svg></button></div><divclass="navbarSearchContainer_Bca1"><buttontype="button"class="DocSearch DocSearch-Button"aria-label="Search"><spanclass="DocSearch-Button-Container"><svgwidth="20"height="20"class="DocSearch-Search-Icon"viewBox="0 0 20 20"><pathd="M14.38614.386l4.08774.0877-4.0877-4.0877c-2.
<divclass="theme-admonition theme-admonition-tip admonition_xJq3 alert alert--success"><divclass="admonitionHeading_Gvgb"><spanclass="admonitionIcon_Rf37"><svgviewBox="0 0 12 16"><pathfill-rule="evenodd"d="M6.5 0C3.48 0 1 2.19 1 5c0 .92.55 2.25 1 3 1.34 2.25 1.78 2.78 2 4v1h5v-1c.22-1.22.66-1.75 2-4 .45-.75 1-2.08 1-3 0-2.81-2.48-5-5.5-5zm3.64 7.48c-.25.44-.47.8-.67 1.11-.86 1.41-1.25 2.06-1.45 3.23-.02.05-.02.11-.02.17H5c0-.06 0-.13-.02-.17-.2-1.17-.59-1.83-1.45-3.23-.2-.31-.42-.67-.67-1.11C2.44 6.78 2 5.65 2 5c0-2.2 2.02-4 4.5-4 1.22 0 2.36.42 3.22 1.19C10.55 2.94 11 3.94 11 5c0 .66-.44 1.78-.86 2.48zM4 14h5c-.23 1.14-1.3 2-2.5 2s-2.27-.86-2.5-2z"></path></svg></span>tip</div><divclass="admonitionContent_BuS1"><p>In case you have any questions, feel free to reach out either by email, Discord
or just by submitting an issue <ahref="https://gitlab.fi.muni.cz/xfocko/kb/-/issues/new"target="_blank"rel="noopener noreferrer">here</a>.</p></div></div>
<p>For this bonus you can get 3 K₡ and another 0.5 K₡ for the bonus part of it.</p>
<h2class="anchor anchorWithStickyNavbar_LWe7"id="introduction">Introduction<ahref="#introduction"class="hash-link"aria-label="Direct link to Introduction"title="Direct link to Introduction"></a></h2>
<p>In this task you are given a 2D map for a robot. The map contains multiple markers:</p>
<ul>
<li><code>^v<></code> - which denote the directions the robot will be facing when he steps into
the cell or starts on it.</li>
<li><code>K</code> - denotes the key.</li>
<li><code>T</code> - denotes the treasure.</li>
</ul>
<p>In case robot lands at the beginning on unknown field, e.g. <code>.</code> in the tests, he
faces the direction that is given through the parameter.</p>
<p>Your task is to write the <code>walk</code> function that returns end result of the walk.
Walk can end in multiple ways:</p>
<ul>
<li><code>FOUND_TREASURE</code> - when you find the treasure</li>
<li><code>FOUND_KEY</code> - when you find the key</li>
<li><code>OUT_OF_BOUNDS</code> - when the robot falls off the map</li>
<li><code>INFINITE_LOOP</code> - in case you will implement the bonus</li>
<li><code>NONE</code> - which is used right now as a default return in the skeleton, has no meaning
later on</li>
</ul>
<h2class="anchor anchorWithStickyNavbar_LWe7"id="hard-requirement">Hard requirement<ahref="#hard-requirement"class="hash-link"aria-label="Direct link to Hard requirement"title="Direct link to Hard requirement"></a></h2>
<p>There is only one hard requirement that tests cannot check.</p>
<p><strong>You are not allowed to use any indexing related to map or your current position</strong>
<strong>in your implementation.</strong></p>
<p>Reason for this requirement is for you to get used to working with pointers. And
for the implementation of this task it is much easier to use just the pointers.</p>
<h2class="anchor anchorWithStickyNavbar_LWe7"id="example-of-run">Example of run<ahref="#example-of-run"class="hash-link"aria-label="Direct link to Example of run"title="Direct link to Example of run"></a></h2>
<p>For a better understanding of your task, I will describe a simple walk with corresponding
<h2class="anchor anchorWithStickyNavbar_LWe7"id="bonus-part">Bonus part<ahref="#bonus-part"class="hash-link"aria-label="Direct link to Bonus part"title="Direct link to Bonus part"></a></h2>
<p>For the bonus part you are supposed to return <code>INFINITE_LOOP</code> in case the robot
is stuck in the infinite loop. There are three tests for it. If you pass only the
easy and medium one, you can get 0.25 K₡ for doing your best and trying it out. :)</p>
<h2class="anchor anchorWithStickyNavbar_LWe7"id="easter-eggs">Easter eggs<ahref="#easter-eggs"class="hash-link"aria-label="Direct link to Easter eggs"title="Direct link to Easter eggs"></a></h2>
<p>Majority of the line count in solution is caused by the formatting :)</p>
</li>
<li>
<p>Included headers can be interpreted as hints, same goes for the unimplemented
<code>static</code> functions which you can use, but <strong>are not required</strong>.</p>
</li>
<li>
<p>Given <code>CMakeLists.txt</code> will generate 2 binaries, <code>test_maze</code> and <code>maze</code>.</p>
<ul>
<li><code>test_maze</code> runs the tests you are given.</li>
<li><code>maze</code> runs the <code>main.c</code>, where you can debug, print mazes and whatever else
you want.</li>
</ul>
</li>
<li>
<p>I keep only one copy of <code>cut.h</code> in my repository, so you need to download it from
<ahref="https://gitlab.fi.muni.cz/pb071/cut/-/jobs/159010/artifacts/file/1header/cut.h"target="_blank"rel="noopener noreferrer">here</a> and place it into the directory where you have your source code.</p>
<ul>
<li>Or you can use the one you have from the latest homework, git will keep it
only once, so it doesn't take up more space.</li>
</ul>
</li>
<li>
<p>I would recommend cloning this repository and copying the <code>maze</code> directory to
your own repository, since there are multiple files and it may be easier for you.</p>
</li>
</ul>
<p>In case you have any questions, feel free to reach out to me.</p>
<h2class="anchor anchorWithStickyNavbar_LWe7"id="submitting">Submitting<ahref="#submitting"class="hash-link"aria-label="Direct link to Submitting"title="Direct link to Submitting"></a></h2>
<p>For submitting the bonus assignment you can follow the same procedure as for
submitting the homeworks, that is:</p>
<ol>
<li>On branch <code>main</code> add the provided skeleton.</li>
<li>Checkout new branch <code>seminar-bonus-04</code>.</li>
<li>Add your solution to the newly created branch.</li>
<li>Create a MR to the <code>main</code> branch with me (<code>@xfocko</code>) as the reviewer.</li>
