<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://www.cs.vassar.edu/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://www.cs.vassar.edu/feed.php">
        <title>Computer Science | Vassar College</title>
        <description></description>
        <link>https://www.cs.vassar.edu/</link>
        <image rdf:resource="https://www.cs.vassar.edu/_media/favicon.ico" />
       <dc:date>2026-04-12T11:24:34+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://www.cs.vassar.edu/people/mlsmith/infinite-trees?rev=1588356833&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://www.cs.vassar.edu/_media/favicon.ico">
        <title>Computer Science | Vassar College</title>
        <link>https://www.cs.vassar.edu/</link>
        <url>https://www.cs.vassar.edu/_media/favicon.ico</url>
    </image>
    <item rdf:about="https://www.cs.vassar.edu/people/mlsmith/infinite-trees?rev=1588356833&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-01T18:13:53+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>infinite-trees</title>
        <link>https://www.cs.vassar.edu/people/mlsmith/infinite-trees?rev=1588356833&amp;do=diff</link>
        <description>Infinite Trees



1 Motivation

Up until now, we’ve mostly looked at trees as a data structure, but we haven’t looked at them in the context of any particular problems. Trees are used in many applications in computer science, robotics, and game design. One common application is for representing the possible moves in a game or search problem. Imagine that you were exploring the space that a player (character or robot) could move through. On each move, the player would change position (and possibl…</description>
    </item>
</rdf:RDF>
