请问一道算法题 tic tac toe tree

是EPIC的一道考题

An updated tic tac toe game: n*n matrix, two users: X and O. If 3 respective marks together(no mater: vertical, horizontal, diagonal ) will win 1 point; For user X, 6 respective marks together will win 3 points; For user O, 8 respective marks together will win 6 points, check who win.

有人能说一下思路吗？
关于题目的理解，如果有四个，算不算？算两个三个 +2， 还是直接忽略？