<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>PyPI recent updates for gymcts</title>
    <link>https://pypi.org/project/gymcts/</link>
    <description>Recent updates to the Python Package Index for gymcts</description>
    <language>en</language>    <item>
      <title>1.5.0</title>
      <link>https://pypi.org/project/gymcts/1.5.0/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Wed, 11 Feb 2026 10:23:41 GMT</pubDate>
    </item>    <item>
      <title>1.4.6</title>
      <link>https://pypi.org/project/gymcts/1.4.6/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Tue, 03 Feb 2026 09:29:20 GMT</pubDate>
    </item>    <item>
      <title>1.4.5</title>
      <link>https://pypi.org/project/gymcts/1.4.5/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Thu, 17 Jul 2025 11:34:53 GMT</pubDate>
    </item>    <item>
      <title>1.4.4</title>
      <link>https://pypi.org/project/gymcts/1.4.4/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Wed, 16 Jul 2025 09:17:09 GMT</pubDate>
    </item>    <item>
      <title>1.4.3</title>
      <link>https://pypi.org/project/gymcts/1.4.3/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Mon, 14 Jul 2025 20:30:10 GMT</pubDate>
    </item>    <item>
      <title>1.4.2</title>
      <link>https://pypi.org/project/gymcts/1.4.2/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Mon, 14 Jul 2025 20:24:02 GMT</pubDate>
    </item>    <item>
      <title>1.4.1</title>
      <link>https://pypi.org/project/gymcts/1.4.1/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Mon, 14 Jul 2025 18:31:51 GMT</pubDate>
    </item>    <item>
      <title>1.4.0</title>
      <link>https://pypi.org/project/gymcts/1.4.0/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Mon, 14 Jul 2025 18:15:10 GMT</pubDate>
    </item>    <item>
      <title>1.3.0</title>
      <link>https://pypi.org/project/gymcts/1.3.0/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Mon, 14 Jul 2025 12:40:55 GMT</pubDate>
    </item>    <item>
      <title>1.2.1</title>
      <link>https://pypi.org/project/gymcts/1.2.1/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Fri, 25 Apr 2025 15:27:40 GMT</pubDate>
    </item>    <item>
      <title>1.2.0</title>
      <link>https://pypi.org/project/gymcts/1.2.0/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Tue, 25 Mar 2025 12:37:52 GMT</pubDate>
    </item>    <item>
      <title>1.0.0</title>
      <link>https://pypi.org/project/gymcts/1.0.0/</link>
      <description>A minimalistic implementation of the Monte Carlo Tree Search algorithm for planning problems fomulated as gymnaisum reinforcement learning environments.</description>
<author>alexander.nasuta@wzl-iqs.rwth-aachen.de</author>      <pubDate>Fri, 28 Feb 2025 12:41:29 GMT</pubDate>
    </item>  </channel>
</rss>