In: Computer Science
•Formal definition as a search problem (tic tac toe):
–Initial state: ??
–Player(s): ??
–Actions(s): ??
–Result(s,a): ??
–(2nd ed.: Successor function: ??
–Terminal-Test(s): ??
–Utility function(s,p): ??
•E.g., win (+1), lose (-1), and draw (0) in tic-tac-toe.
It is request to please don't leave without thumbs up I really need it so that I can provide quality answer to you hoping for good thank you!
I have answer this question according to the question in my language hope you like and please don't dislike
So you answer of the question provide below : Answer is absolutely correct