| http://www.w3.org/ns/prov#value | - Then we have a simple polynomial-time algorithm for finding the highest-scoring move in a given position: for each starting square, and each direction (horizontal/vertical), and each word W in the dictionary, decide whether W is a valid move with the given rack; and choose the highest-scoring valid move.
|
