title: What's the fast algorithm to check given board of nash's hex is ended?
body: <p>Refer this link: <a href="http://en.wikipedia.org/wiki/Hex_(board_game)" rel="nofollow">http://en.wikipedia.org/wiki/Hex_(board_game)</a></p>
  
  <p>I'm making Hex game, but I have no idea to check given game is ended.</p>
  
  <p>So What the great algorithm check that given game is ended?</p>
  
  <p>In here, ending means that exactly one person connect completely a line.</p>
  
  <p>Question: Given positions of pieces of two players, What's the good algorithm to determine "Is there a complete line that makes game end?"</p>