title: Gomoku state-of-the-art tech
body: <p>usually people use pn-search or pn^2 Or df-pn to answer if there is a win solution.</p>
  
  <p>then they use alpha-beta pruning on the min-max game tree with a good evaluation function</p>
  
  <p>they can reach a depth of 15 ply or even more</p>
  
  <p>now there is a Monte Carlo method which is successful in dealing with Go.</p>
  
  <p>Is the same tech can be used in Gomoku ? any examples (source code or paper)</p>
  
  <p>Is there any paper describe a good way to build a well tuned evaluation function.</p>
  
  <p>or Is there any other state-of-the-art or useful tech to deal with Gomoku ?</p>
  
  <p>Is pn search necessary in dealing with Gomoku?</p>
  
  <p>Is there any different VCT engine (src better) ?</p>