[sandeepunnao]

I need some help in a go board game implementation.
I'm given a color and a 19*19 matrix and i have to print out the best possible move within 2seconds...(It need not to be best at least somewhat good...😉)

Can anybody help me in making a program for it.Some algorithms or psuedocode will also help.🤝

Input will be like :
First line My color
Next 19 lines with 19 words
where
'X' represents Blank Space
'B' represents Black
'W' represents White

Somebody help at least give me some clue to start...
I dont know about trees and graph very well 😭