Re: [Rails-devel] Question regarding existence of routes

SourceForge Headquarters 225 Broadway Suite 1600 San Diego, CA 92101 +1 (858) 422-6466

<html>
 <head>
 </head>
 <body>You coded against Rail 1.x, this part of the code is upgraded in Rails 2.0 branches. 
Especially the connectivity functions are improved. If you check out Rails 2.0 you will realize that it supports full verification of tile lays. 
So I suggest that you code that functionally in 2.0 otherwise it will most likely duplicate efforts and will not be mergeable. 
 <div class="gmail_quote">Michael Alexander &lt;out...@gm...&gt; wrote:<blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">

    <div>
      So what I found was that the NetworkIterator stopped at nodes that were sinks.&nbsp; If I want to be able to build a graph that just tells me that I&#39;m connected and ignores tokens in the way, I think I need to add a setting to NetworkIterator to tell it if it should ignore sinks.&nbsp; As this is a complicated area of the code, and it&#39;s not limited to the 1880 specific areas, I&#39;d appreciate some feedback on my proposed changes:<br/>
      <br/>
      diff --git a/rails/algorithms/NetworkCompanyGraph.java b/rails/algorithms/NetworkCompanyGraph.java<br/>
      index bd93113..0e5b2c8 100644<br/>
      --- a/rails/algorithms/NetworkCompanyGraph.java<br/>
      +++ b/rails/algorithms/NetworkCompanyGraph.java<br/>
      @@ -64,7 +64,8 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return phase2Graph;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; }<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;<br/>
      -&nbsp;&nbsp;&nbsp; public SimpleGraph&lt;NetworkVertex, NetworkEdge&gt; createRouteGraph(boolean addHQ) {<br/>
      +&nbsp;&nbsp;&nbsp;<br/>
      +&nbsp;&nbsp;&nbsp; private SimpleGraph&lt;NetworkVertex, NetworkEdge&gt; createGraph(boolean addHQ, boolean ignoreSinks) {<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // get mapgraph from builder<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; SimpleGraph&lt;NetworkVertex, NetworkEdge&gt; mapGraph = graphBuilder.getMapGraph();<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br/>
      @@ -88,7 +89,7 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // add connection to graph<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; graph.addVertex(vertex);<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; graph.addEdge(vertex, hqVertex, new NetworkEdge(vertex, hqVertex, false));<br/>
      -&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NetworkIterator iterator = new NetworkIterator(mapGraph, vertex, company);<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NetworkIterator iterator = new NetworkIterator(mapGraph, vertex, company, ignoreSinks);<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (;iterator.hasNext();)<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; vertexes.add(iterator.next());<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // restore sink property<br/>
      @@ -112,6 +113,14 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return graph;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; }<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;<br/>
      +&nbsp;&nbsp;&nbsp; public SimpleGraph&lt;NetworkVertex, NetworkEdge&gt; createRouteGraph(boolean addHQ) {<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return createGraph(addHQ, false);<br/>
      +&nbsp;&nbsp;&nbsp; }<br/>
      +<br/>
      +&nbsp;&nbsp;&nbsp; public SimpleGraph&lt;NetworkVertex, NetworkEdge&gt; createConnectionGraph(boolean addHQ) {<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return createGraph(addHQ, true);<br/>
      +&nbsp;&nbsp;&nbsp; }<br/>
      +&nbsp;&nbsp;&nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; public List&lt;NetworkVertex&gt; getCompanyBaseTokenVertexes(PublicCompanyI company) {<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; List&lt;NetworkVertex&gt; vertexes = new ArrayList&lt;NetworkVertex&gt;();<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (TokenI token:company.getTokens()){<br/>
      diff --git a/rails/algorithms/NetworkIterator.java b/rails/algorithms/NetworkIterator.java<br/>
      index f4029e8..1adc0a6 100644<br/>
      --- a/rails/algorithms/NetworkIterator.java<br/>
      +++ b/rails/algorithms/NetworkIterator.java<br/>
      @@ -26,6 +26,7 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; private NetworkVertex startVertex;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; private boolean startVertexVisited;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; private boolean routeIterator;<br/>
      +&nbsp;&nbsp;&nbsp; private boolean ignoreSinks;<br/>
      &nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; // internal data<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; private List&lt;NetworkVertex&gt; stack = new ArrayList&lt;NetworkVertex&gt;();<br/>
      @@ -41,14 +42,14 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; public NetworkIterator(Graph&lt;NetworkVertex, NetworkEdge&gt; graph,<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NetworkVertex startVertex) {<br/>
      -&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this(graph, startVertex, null);<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this(graph, startVertex, null, false);<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; }<br/>
      &nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; /**<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; * Returns NetworkIterator for specific company<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; */<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; public NetworkIterator(Graph&lt;NetworkVertex, NetworkEdge&gt; graph, NetworkVertex startVertex,<br/>
      -&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PublicCompanyI company) {<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PublicCompanyI company, boolean ignoreSinks) {<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; super();<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (graph == null)<br/>
      @@ -61,6 +62,7 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this.startVertex = startVertex;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this.startVertexVisited = false;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this.routeIterator = false;<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this.ignoreSinks = ignoreSinks;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; }<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; NetworkIterator setRouteIterator(boolean routeIterator) {<br/>
      @@ -174,7 +176,7 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; private void addUnseenChildrenOf(NetworkVertex vertex, boolean greedy) {<br/>
      &nbsp;<br/>
      -&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (vertex.isSink()) return;<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (vertex.isSink() &amp;&amp; (!ignoreSinks)) return;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; log.debug(&quot;Iterator: Add unseen children of &quot; + vertex);<br/>
      &nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (NetworkEdge edge : graph.edgesOf(vertex)) {<br/>
      diff --git a/rails/algorithms/NetworkVertex.java b/rails/algorithms/NetworkVertex.java<br/>
      index 91356af..03045b9 100644<br/>
      --- a/rails/algorithms/NetworkVertex.java<br/>
      +++ b/rails/algorithms/NetworkVertex.java<br/>
      @@ -311,7 +311,7 @@<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; */<br/>
      &nbsp;&nbsp;&nbsp;&nbsp; public static void initAllRailsVertices(Graph&lt;NetworkVertex, NetworkEdge&gt; graph,<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PublicCompanyI company,&nbsp; PhaseI phase) {<br/>
      -<br/>
      +&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // store vertices for removal<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; List&lt;NetworkVertex&gt; verticesToRemove = new ArrayList&lt;NetworkVertex&gt;();<br/>
      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (NetworkVertex v:graph.vertexSet()) {<br/>
    </div>
    <div class="gmail_extra">
      <br/>
      <br/>
      <div class="gmail_quote">
        On Wed, Aug 28, 2013 at 4:52 PM, Michael Alexander<span> &lt;<a href="mailto:out...@gm..." target="_blank">out...@gm...</a>&gt;</span> wrote:<br/>
        <blockquote class="gmail_quote" style="margin: 0 0 0 0.8ex;border-left: 1.0px rgb(204,204,204) solid;padding-left: 1.0ex;">
          <div>
            <div>
              Here&#39;s what I ended up with so far:<br/>
              <br/>
            </div>
            <div>
              &nbsp;&nbsp;&nbsp; compA is the private investor<br/>
            </div>
            <div>
              &nbsp;&nbsp;&nbsp; compB is the company to check to see if there is a connection with<br/>
            </div>
            <div>
              <br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PublicCompanyI compA = operatingCompany.get();<br/>
              ...<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NetworkGraphBuilder nwGraph = NetworkGraphBuilder.create(gameManager);<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NetworkCompanyGraph companyGraph = NetworkCompanyGraph.create(nwGraph, compA);<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; SimpleGraph&lt;NetworkVertex, NetworkEdge&gt; graph = companyGraph.createRouteGraph(true);<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Set&lt;NetworkVertex&gt; verticies = graph.vertexSet();<br/>
              ...<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (TokenI token : compB.getTokens()) {<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; TokenHolder holder = token.getHolder();<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (!(holder instanceof Stop)) continue;<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Stop city = (Stop) holder;<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Station station = city.getRelatedStation();<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (NetworkVertex vert : verticies) {<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (vert.getType() == NetworkVertex.VertexType.STATION) {<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Station vertStation = vert.getStation();<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (station == vertStation) {<br/>
            </div>
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // There is a link between the companies!&nbsp; Hooray!<br/>
            <div>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br/>
              &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br/>
              ...<br/>
              <br/>
            </div>
            <div>
              This seems to work for simple cases, however, I suspect (without digging too much) that it will get blocked by tokens, which I can&#39;t have.&nbsp; I bet it won&#39;t be too hard to fix, tho.<br/>
              <br/>
              Mike<br/>
            </div>
            <div>
              <br/>
            </div>
          </div>
          <div class="HOEnZb">
            <div class="h5">
              <div class="gmail_extra">
                <br/>
                <br/>
                <div class="gmail_quote">
                  On Wed, Aug 28, 2013 at 2:38 PM, brett lentz<span> &lt;<a href="mailto:bre...@gm..." target="_blank">bre...@gm...</a>&gt;</span> wrote:<br/>
                  <blockquote class="gmail_quote" style="margin: 0 0 0 0.8ex;border-left: 1.0px rgb(204,204,204) solid;padding-left: 1.0ex;">
                    <div>
                      In order to do tile rotations, there is already logic that is aware of the &quot;exits&quot; of a tile. There&#39;s also the route suggestion code.<br/>
                      <br/>
                      It might be possible to leverage that same code to create a route graph that enables detection of destination runs.<br/>
                      <br/>
                      It probably needs a fair bit of work to adapt for this purpose, but those are at least places in the code to start looking.
                      <div>
                        <br/>
                      </div>
                      <div>
                        ---Brett.
                      </div>
                    </div>
                    <div class="gmail_extra">
                      <span><font color="#888888"><br clear="all"/>
                      <div>
                        <br/>
                        ---Brett.
                      </div>
                      </font></span>
                      <div>
                        <div>
                          <br/>
                          <br/>
                          <div class="gmail_quote">
                            On Wed, Aug 28, 2013 at 9:50 AM, Chris Shaffer<span> &lt;<a href="mailto:chr...@gm..." target="_blank">chr...@gm...</a>&gt;</span> wrote:<br/>
                            <blockquote class="gmail_quote" style="margin: 0 0 0 0.8ex;border-left: 1.0px rgb(204,204,204) solid;padding-left: 1.0ex;">
                              There are games where tokens do block destinations, so whatever code<br/>
                              you write should allow for that possibility. There are also games<br/>
                              where connections are considered complete as soon as the tile is laid,<br/>
                              and others where the check occurs during the relevant company&#39;s<br/>
                              operating turn.<br/>
                              <div>
                                <br/>
                                --<br/>
                                Chris<br/>
                                <br/>
                                Please consider the environment before printing this e-mail.<br/>
                                <br/>
                                <br/>
                              </div>
                              <div>
                                <div>
                                  On Wed, Aug 28, 2013 at 6:35 AM, Michael Alexander<br/>
                                  &lt;<a href="mailto:out...@gm..." target="_blank">out...@gm...</a>&gt; wrote:<br/>
                                  &gt; Both Major Companies in 1856 and Foreign Investors in 1880 have the idea of<br/>
                                  &gt; needing to reach a destination. &nbsp;Both are implemented by having the game<br/>
                                  &gt; player use a special action to tell the game engine that a connection has<br/>
                                  &gt; taken place. &nbsp;Once the connection exists, some one time event occurs. &nbsp;It<br/>
                                  &gt; seems like if there is code that could be used to determine if a connection<br/>
                                  &gt; exists, the game could automatically determine that without relying on the<br/>
                                  &gt; player to tell it.<br/>
                                  &gt;<br/>
                                  &gt; So I actually want something slightly different than what I said. &nbsp;It&#39;s not<br/>
                                  &gt; that the current company can make a run between two hexes that I want to<br/>
                                  &gt; know, it&#39;s that a connection exists (regardless of tokens).<br/>
                                  &gt;<br/>
                                  &gt; Mike<br/>
                                  &gt;<br/>
                                  &gt;<br/>
                                  &gt; On Wed, Aug 28, 2013 at 9:28 AM, Chris Shaffer &lt;<a href="mailto:chr...@gm..." target="_blank">chr...@gm...</a>&gt;<br/>
                                  &gt; wrote:<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt; Would this be for games where companies are limited to building track<br/>
                                  &gt;&gt; where their trains can actually reach, or some other purpose?<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt; --<br/>
                                  &gt;&gt; Chris<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt; Please consider the environment before printing this e-mail.<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt; On Tue, Aug 27, 2013 at 11:24 PM, Michael Alexander<br/>
                                  &gt;&gt; &lt;<a href="mailto:out...@gm..." target="_blank">out...@gm...</a>&gt; wrote:<br/>
                                  &gt;&gt; &gt; Everyone,<br/>
                                  &gt;&gt; &gt;<br/>
                                  &gt;&gt; &gt; &nbsp; &nbsp; I&#39;d like to add a check to see if the currently operating company<br/>
                                  &gt;&gt; &gt; can<br/>
                                  &gt;&gt; &gt; run from specific MapHex to another. &nbsp;It seems like there should be a<br/>
                                  &gt;&gt; &gt; way to<br/>
                                  &gt;&gt; &gt; do this, since a similar calculation would have to be made when<br/>
                                  &gt;&gt; &gt; determining<br/>
                                  &gt;&gt; &gt; what MapHexs are eligible to have a tile placed, but I can&#39;t seem to<br/>
                                  &gt;&gt; &gt; figure<br/>
                                  &gt;&gt; &gt; out how to do it. &nbsp;What am I missing?<br/>
                                  &gt;&gt; &gt;<br/>
                                  &gt;&gt; &gt; &nbsp; &nbsp; Thanks,<br/>
                                  &gt;&gt; &gt;<br/>
                                  &gt;&gt; &gt; Michael Alexander<br/>
                                  &gt;&gt; &gt;<br/>
                                  &gt;&gt; &gt;<br/>
                                  &gt;&gt; &gt; ------------------------------------------------------------------------------<br/>
                                  &gt;&gt; &gt; Learn the latest--Visual Studio 2012, SharePoint 2013, SQL 2012, more!<br/>
                                  &gt;&gt; &gt; Discover the easy way to master current and previous Microsoft<br/>
                                  &gt;&gt; &gt; technologies<br/>
                                  &gt;&gt; &gt; and advance your career. Get an incredible 1,500+ hours of step-by-step<br/>
                                  &gt;&gt; &gt; tutorial videos with LearnDevNow. Subscribe today and save!<br/>
                                  &gt;&gt; &gt;<br/>
                                  &gt;&gt; &gt;<a href="http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk" target="_blank"> http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk</a><br/>
                                  &gt;&gt; &gt; _______________________________________________<br/>
                                  &gt;&gt; &gt; Rails-devel mailing list<br/>
                                  &gt;&gt; &gt;<a href="mailto:Rai...@li..." target="_blank"> Rai...@li...</a><br/>
                                  &gt;&gt; &gt;<a href="https://lists.sourceforge.net/lists/listinfo/rails-devel" target="_blank"> https://lists.sourceforge.net/lists/listinfo/rails-devel</a><br/>
                                  &gt;&gt; &gt;<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt; ------------------------------------------------------------------------------<br/>
                                  &gt;&gt; Learn the latest--Visual Studio 2012, SharePoint 2013, SQL 2012, more!<br/>
                                  &gt;&gt; Discover the easy way to master current and previous Microsoft<br/>
                                  &gt;&gt; technologies<br/>
                                  &gt;&gt; and advance your career. Get an incredible 1,500+ hours of step-by-step<br/>
                                  &gt;&gt; tutorial videos with LearnDevNow. Subscribe today and save!<br/>
                                  &gt;&gt;<br/>
                                  &gt;&gt;<a href="http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk" target="_blank"> http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk</a><br/>
                                  &gt;&gt; _______________________________________________<br/>
                                  &gt;&gt; Rails-devel mailing list<br/>
                                  &gt;&gt;<a href="mailto:Rai...@li..." target="_blank"> Rai...@li...</a><br/>
                                  &gt;&gt;<a href="https://lists.sourceforge.net/lists/listinfo/rails-devel" target="_blank"> https://lists.sourceforge.net/lists/listinfo/rails-devel</a><br/>
                                  &gt;<br/>
                                  &gt;<br/>
                                  &gt;<br/>
                                  &gt; ------------------------------------------------------------------------------<br/>
                                  &gt; Learn the latest--Visual Studio 2012, SharePoint 2013, SQL 2012, more!<br/>
                                  &gt; Discover the easy way to master current and previous Microsoft technologies<br/>
                                  &gt; and advance your career. Get an incredible 1,500+ hours of step-by-step<br/>
                                  &gt; tutorial videos with LearnDevNow. Subscribe today and save!<br/>
                                  &gt;<a href="http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk" target="_blank"> http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk</a><br/>
                                  &gt; _______________________________________________<br/>
                                  &gt; Rails-devel mailing list<br/>
                                  &gt;<a href="mailto:Rai...@li..." target="_blank"> Rai...@li...</a><br/>
                                  &gt;<a href="https://lists.sourceforge.net/lists/listinfo/rails-devel" target="_blank"> https://lists.sourceforge.net/lists/listinfo/rails-devel</a><br/>
                                  &gt;<br/>
                                  <br/>
                                  ------------------------------------------------------------------------------<br/>
                                  Learn the latest--Visual Studio 2012, SharePoint 2013, SQL 2012, more!<br/>
                                  Discover the easy way to master current and previous Microsoft technologies<br/>
                                  and advance your career. Get an incredible 1,500+ hours of step-by-step<br/>
                                  tutorial videos with LearnDevNow. Subscribe today and save!<br/>
                                  <a href="http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk" target="_blank">http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk</a><br/>
                                  _______________________________________________<br/>
                                  Rails-devel mailing list<br/>
                                  <a href="mailto:Rai...@li..." target="_blank">Rai...@li...</a><br/>
                                  <a href="https://lists.sourceforge.net/lists/listinfo/rails-devel" target="_blank">https://lists.sourceforge.net/lists/listinfo/rails-devel</a><br/>
                                </div>
                              </div>
                            </blockquote>
                          </div>
                          <br/>
                        </div>
                      </div>
                    </div>
                    <br/>
                    ------------------------------------------------------------------------------<br/>
                    Learn the latest--Visual Studio 2012, SharePoint 2013, SQL 2012, more!<br/>
                    Discover the easy way to master current and previous Microsoft technologies<br/>
                    and advance your career. Get an incredible 1,500+ hours of step-by-step<br/>
                    tutorial videos with LearnDevNow. Subscribe today and save!<br/>
                    <a href="http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk" target="_blank">http://pubads.g.doubleclick.net/gampad/clk?id=58040911&amp;iu=/4140/ostg.clktrk</a><br/>
                    _______________________________________________<br/>
                    Rails-devel mailing list<br/>
                    <a href="mailto:Rai...@li..." target="_blank">Rai...@li...</a><br/>
                    <a href="https://lists.sourceforge.net/lists/listinfo/rails-devel" target="_blank">https://lists.sourceforge.net/lists/listinfo/rails-devel</a><br/>
                    <br/>
                  </blockquote>
                </div>
                <br/>
              </div>
            </div>
          </div>
        </blockquote>
      </div>
      <br/>
    </div>
  </blockquote></div></body>
</html>