トップ 差分 一覧 ソース 検索 ヘルプ RSS ログイン

Arkth

 Feature of Arkth(the name of my othello program)

Search Routine

"Max-Min" using "α-βCut"(I'll make "Order System" used before the main search)

Valuation Function

Calculating valuation of the state by

  1. number of places where Arkth can put a stone
  2. number of places where opponent can put a stone
  3. number of Arkth's stones that will be never reversed
  4. number of opponent's stones that will be never reversed
  5. number of empty places that surrounds Arkth's stones
  6. number of empty places that surrounds opponent's stones
  7. valuation of place where opponent's stones exists
  8. valuation of place where Arkth will put a stone in this turn