<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="/ib002/">IB002: Algorithms</a></li><li><aaria-current="page"class="dropdown__link dropdown__link--active"href="/pb071/">PB071: C</a></li><li><aclass="dropdown__link"href="/pb161/">PB161: 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="searchBox_ZlJk"><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.386 14.386l4.0877 4.0877-4.0877-4.0877c-2.9418 2.9419-7.7115 2.9419-10.6533 0-2.9419-2.9418-2.9419-7.7115 0-10.6533 2.9418-2.9419 7.7115-2.9419 10.6533 0 2.9419 2.9418 2.9419 7.7115 0 10.6533z"stroke="currentColor"fill="none"fill-rule="evenodd"stroke-linecap="round"stroke-linejoin="round"></path></svg><spanclass="DocSearch-Button-Placeholder">Search</span></span><spanclass="DocSearch-Button-Keys"></span></button></div></div></div><divrole="presentation"class="navbar-sidebar__backdrop"></div></nav><divid="__docusaurus_skipToContent_fallback"class="main-wrappermainWrapper_
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><p><ahref="/files/pb071/bonuses/04.tar.gz"target="_blank"rel="noopener noreferrer">Source</a></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
function call.</p><divclass="language-c codeBlockContainer_Ckt0 theme-code-block"style="--prism-color:#000000;--prism-background-color:#ffffff"><divclass="codeBlockContent_biex"><pretabindex="0"class="prism-code language-c codeBlock_bY9V thin-scrollbar"><codeclass="codeBlockLines_e6Vv"><spanclass="token-line"style="color:#000000"><spanclass="token keyword"style="color:rgb(0, 0, 255)">const</span><spanclass="token plain"></span><spanclass="token keyword"style="color:rgb(0, 0, 255)">char</span><spanclass="token plain"></span><spanclass="token operator"style="color:rgb(0, 0, 0)">*</span><spanclass="token plain">map </span><spanclass="token operator"style="color:rgb(0, 0, 0)">=</span><spanclass="token plain"></span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">(</span><spanclass="token plain"></span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"></span><spanclass="token string"style="color:rgb(163, 21, 21)">">.v"</span><spanclass="token plain"></span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"></span><spanclass="token string"style="color:rgb(163, 21, 21)">".K<"</span><spanclass="token plain"></span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"></span><spanclass="token string"style="color:rgb(163, 21, 21)">"..."</span><spanclass="token plain"></span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"></span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">)</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">;</span><spanclass="token plain"></span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"style="display:inline-block"></span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"></span><spanclass="token function"style="color:rgb(0, 0, 255)">walk</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">(</span><spanclass="token plain">map</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">,</span><spanclass="token plain"></span><spanclass="token operator"style="color:rgb(0, 0, 0)">&</span><spanclass="token plain">map</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">[</span><spanclass="token number"style="color:rgb(9, 134, 88)">6</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">]</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">,</span><spanclass="token plain"></span><spanclass="token char"style="color:rgb(129, 31, 63)">'^'</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">,</span><spanclass="token plain"></span><spanclass="token number"style="color:rgb(9, 134, 88)">3</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">,</span><spanclass="token plain"></span><spanclass="token number"style="color:rgb(9, 134, 88)">3</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">)</span><spanclass="token punctuation"style="color:rgb(4, 81, 165)">;</span><br></span></code></pre><divclass="buttonGroup__atx"><buttontype="button"aria-label="Copy code to clipboard"title="Copy"class="clean-btn"><spanclass="copyButtonIcons_eSgA"aria-hidden="true"><svgviewBox="0 0 24 24"class="copyButtonIcon_y97N"><pathfill="currentColor"d="M19,21H8V7H19M19,5H8A2,2 0 0,0 6,7V21A2,2 0 0,0 8,23H19A2,2 0 0,0 21,21V7A2,2 0 0,0 19,5M16,1H4A2,2 0 0,0 2,3V17H4V3H16V1Z"></path></svg><svgviewBox="0 0 24 24"class="copyButtonSuccessIcon_LjdS"><pathfill="currentColor"d="M21,7L9,19L3.5,13.5L4.91,12.09L9,16.17L19.59,5.59L21,7Z"></path></svg></span></button></div></div></div><p>For this call, you should return <code>FOUND_KEY</code>. Let us walk through the walk ;)</p><ol><li><p>Robot is placed at the bottom left corner, there is no direction specified, so
he follows the direction given by parameter (upwards, denoted as <code>N</code>(orth),
so that we can differentiate markers on the map with the robot when using printing
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><ul><li><p>Statistics</p><table><thead><tr><th>Language</th><thalign="right">Files</th><thalign="right">Lines</th><thalign="right">Blanks</th><thalign="right">Comments</th><thalign="right">Code</th><thalign="right">Complexity</th></tr></thead><tbody><tr><td><em>C</em></td><tdalign="right">4</td><tdalign="right">458</td><tdalign="right">34</td><tdalign="right">58</td><tdalign="right">366</td><tdalign="right">33</td></tr><tr><td><code>test_maze.c</code></td><tdalign="right"></td><tdalign="right">225</td><tdalign="right">9</td><tdalign="right">0</td><tdalign="right">216</td><tdalign="right">4</td></tr><tr><td><code>sol.maze.c</code></td><tdalign="right"></td><tdalign="right">141</td><tdalign="right">15</td><tdalign="right">28</td><tdalign="right">98</td><tdalign="right">24</td></tr><tr><td><code>maze.c</code></td><tdalign="right"></td><tdalign="right">84</td><tdalign="right">8</td><tdalign="right">30</td><tdalign="right">46</td><tdalign="right">5</td></tr><tr><td><code>main.c</code></td><tdalign="right"></td><tdalign="right">8</td><tdalign="right">2</td><tdalign="right">0</td><tdalign="right">6</td><tdalign="right">0</td></tr><tr><td><em>C Header</em></td><tdalign="right">1</td><tdalign="right">33</td><tdalign="right">3</td><tdalign="right">19</td><tdalign="right">11</td><tdalign="right">0</td></tr><tr><td><code>maze.h</code></td><tdalign="right"></td><tdalign="right">33</td><tdalign="right">3</td><tdalign="right">19</td><tdalign="right">11</td><tdalign="right">0</td></tr><tr><td><em>CMake</em></td><tdalign="right">1</td><tdalign="right">25</td><tdalign="right">4</td><tdalign="right">6</td><tdalign="right">15</td><tdalign="right">2</td></tr><tr><td><code>CMakeLists.txt</code></td><tdalign="right"></td><tdalign="right">25</td><tdalign="right">4</td><tdalign="right">6</td><tdalign="right">15</td><tdalign="right">2</td></tr><tr><td><strong>Total</strong></td><tdalign="right">6</td><tdalign="right">516</td><tdalign="right">41</td><tdalign="right">83</td><tdalign="right">392</td><tdalign="right">35</td></tr></tbody></table></li><li><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></ol></div><footerclass="theme-doc-footer docusaurus-mt-lg"><divclass="theme-doc-footer-edit-meta-row row"><divclass="col"><ahref="https://gitlab.com/mfocko/blog/tree/main/pb071/bonuses/04.md"target="_blank"rel="noreferrer noopener"class="theme-edit-this-page"><svgfill="currentColor"height="20"width="20"viewBox="0 0 40 40"class="iconEdit_Z9Sw"aria-hidden="true"><g><pathd="m34.5 11.7l-3 3.1-6.3-6.3 3.1-3q0.5-0.5 1.2-0.5t1.1 0.5l3.9 3.9q0.5 0.4 0.5 1.1t-0.5 1.2z m-29.5 17.1l18.4-18.5 6.3 6.3-18.4 18.4h-6.3v-6.2z"></path></g></svg>Edit this page</a></div><divclass="col lastUpdated_vwxv"><spanclass="theme-last-updated">Last updated<!----> on <b><timedatetime="2023-03-13T00:00:00.000Z">Mar 13, 2023</time></b></span></div></div></footer></article><navclass="pagination-nav docusaurus-mt-lg"aria-label="Docs pages"><aclass="pagination-nav__link pagination-nav__link--prev"href="/pb071/bonuses/seminar-03"><divclass="pagination-nav__sublabel">Previous</div><divclass="pagination-nav__label">3rd seminar</div></a><aclass="pagination-nav__link pagination-nav__link--next"href="/pb071/bonuses/seminar-05-06"><divclass="pagination-nav__sublabel">Next</div><divclass="pagination-nav__label">5th and 6th seminar</div></a></nav></div></div><divclass="col col--3"><divclass="tableOfContents_bqdL thin-scrollbar theme-doc-toc-desktop"><ulclass="table-of-contents table-of-contents__left-border"><li><ahref="#introduction"class="table-of-contents__link toc-highlight">Introduction</a></li><li><ahref="#hard-requirement"class="table-of-contents__link toc-highlight">Hard requirement</a></li><li><ahref="#example-of-run"class="table-of-contents__link toc-highlight">Example of run</a></li><li><ahref="#bonus-part"class="table-of-contents__link toc-highlight">Bonus part</a></li><li><ahref="#easter-eggs"class="table-of-contents__link toc-highlight">Easter eggs</a></li><li><ahref="#submitting"class="table-of-contents__link toc-highlight">Submitting</a></li></ul></div></div></div></div></main></div></div><footerclass="footer footer--dark"><divclass="container container-fluid"><divclass="row footer__links"><divclass="col footer__col"><divclass="footer__title">Git</div><ulclass="footer__items clean-list"><liclass="footer__item"><ahref="https://github.com/mfocko"target="_blank"rel="noopener noreferrer"class="footer__link-item">GitHub<svgwidth="13.5"height="13.5"aria-hidden="true"viewBox="0 0 24 24"class="iconExternalLink_nPIU"><pathfill="currentColor"d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a></li><liclass="footer__item"><ahref="https://gitlab.com/mfocko"target="_blank"rel="noopener noreferrer"class="footer__link-item">GitLab<svgwidth="13.5"height="13.5"aria-hidden="true"viewBox="0 0 24 24"class="iconExternalLink_nPIU"><pathfill="currentColor"d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a></li><liclass="footer__item"><ahref="https://git.mfocko.xyz/mfocko"target="_blank"rel="noopener noreferrer"class="footer__link-item">Gitea (self-hosted)<svgwidth="13.5"height="13.5"aria-hidden="true"viewBox="0 0 24 24"class="iconExternalLink_nPIU"><pathfill="currentColor"d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a></li></ul></div><divclass="col footer__col"><divclass="footer__title">Social #1</div><ulclass="footer__items clean-list"><liclass="footer__item"><ahref="https://www.linkedin.com/in/mfocko/"target="_blank"rel="noopener noreferrer"class="footer__link-item">LinkedIn<svgwidth="13.5"height="13.5"aria-hidden="true
