<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Catch multiple pieces of cheese :: Computer science</title>
    <link>https://info.cours.lecalvar.fr/sae-s6/s5/project/session4/index.html</link>
    <description>Duration2h30 + preparation Presentation &amp; objectives In this session, we significantly increase the difficulty, by considering mazes with multiple pieces of cheese. The objective will be to catch them all, in a minimum number of turns. To do so, we will introduce a problem called the “Traveling Salesman Problem (or “Traveling Salesperson Problem”, TSP for short). We will see that this problem is very complex to solve, and that you cannot expect to do it in an acceptable time for large quantities of cheese.</description>
    <generator>Hugo</generator>
    <language>en</language>
    <atom:link href="https://info.cours.lecalvar.fr/sae-s6/s5/project/session4/index.xml" rel="self" type="application/rss+xml" />
  </channel>
</rss>