Optimal Othello/Reversi Move
Python, 184 chars

import os,re
M=os.read(0,99)
s=0
t='x'
for p in range(72):
 c=sum(len(re.match(r'\.w+b|',M[p::d]).group()[2:])for d in(-10,-9,-8,-1,1,8,9,10))
 if c&gt;s:s=c;t='(%d,%d)'%(p/9,p%9)
print t


Coordinates are given as (y,x) with (0,0) in the upper left.

$ ./othello.py &lt; othello1
(5,3)
$ ./othello.py &lt; othello2
(1,1)
$ ./othello.py &lt; othello3
x