<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Catch a single piece of cheese... with mud :: Computer science</title>
    <link>https://info.cours.lecalvar.fr/sae-s6/s5/project/session3/index.html</link>
    <description>Duration2h30 + preparation Presentation &amp; objectives In this session, we slightly increase the difficulty by introducing mud inside the maze. Two adjacent locations in the maze that are separated with mud require more than one unit of time to reach, and therefore cause the character to slow down. While the BFS algorithm seen in the previous session had the property to find the shortest path in an unweighted graph, this is not the case anymore.</description>
    <generator>Hugo</generator>
    <language>en</language>
    <atom:link href="https://info.cours.lecalvar.fr/sae-s6/s5/project/session3/index.xml" rel="self" type="application/rss+xml" />
  </channel>
</rss>