<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
    <title>invariant - algorithms</title>
    <subtitle>Essays on algorithms and data structures by Ali Khalilli. Binary search, numerical methods, dynamic programming, graphs, strings.</subtitle>
    <link rel="self" type="application/atom+xml" href="https://invariant.khalilli.ai/tags/algorithms/atom.xml"/>
    <link rel="alternate" type="text/html" href="https://invariant.khalilli.ai"/>
    <generator uri="https://www.getzola.org/">Zola</generator>
    <updated>2022-02-17T00:00:00+00:00</updated>
    <id>https://invariant.khalilli.ai/tags/algorithms/atom.xml</id>
    <entry xml:lang="en">
        <title>Optimal Game Strategy</title>
        <published>2022-02-17T00:00:00+00:00</published>
        <updated>2022-02-17T00:00:00+00:00</updated>
        
        <author>
          <name>
            
              alikhalilli
            
          </name>
        </author>
        
        <link rel="alternate" type="text/html" href="https://invariant.khalilli.ai/blog/optimal-game-strategy/"/>
        <id>https://invariant.khalilli.ai/blog/optimal-game-strategy/</id>
        
        <summary type="html">&lt;p&gt;Some of the well-known CS problems, such as the choosing of an optimal game strategy, may appear to be mentally exhausting at first glance. However, like with other problems, it necessitates a certain point of view from which we must examine it. First and foremost, let us define the problem:&lt;&#x2F;p&gt;
&lt;blockquote&gt;
&lt;p&gt;This is a game for two players. There are an even amount of coins placed in a row, hence the row is even. There will be alternating turns. Each round, a player has the option of selecting either the first coin in the row or the last coin in the row and keeping it in his possession. If a player moves first, the goal of the issue is to figure out how much money he or she can earn with certainty up to the greatest amount conceivable.&lt;&#x2F;p&gt;
&lt;&#x2F;blockquote&gt;</summary>
        
    </entry>
</feed>
