This is a two-player game. The player and the system get alternative chances to mark their move on the 3x3 grid provided. One who marks 3 linearly oriented squares first, wins the game. If none of the players can do this, the game ends to be a draw. (The system’s move is marked with a circle and the player’s with a cross)

Playstore Link: Tic Tac Toe

Easy

The player starts at random cell. The system’s move is identified using Image processing, We are simply calculating intersecting points for blank, O and X for each one of Nine Cell. the further move is calculated by the MinMax algorithm and is marked in the concerned box using ADB Tool. This continues as the algorithm tries to win the game in the best way possible

• Computer with OpenCV-Python, ADB Tool and required drivers set up.
• An Android Device with the ‘Tic Tac Toe’ game installed on it. (Turn on the Developer options for better visualization)
• USB data transfer cable.

The following command instantaneously takes the screenshot of the connected device and stores it in the SD card following the specified path.

system(' adb shell screencap -p /sdcard/screen.png ');

The following command pulls it from the SD card of the android device into the working system following the path specified

system(' adb pull /sdcard/screen.png ');

The pulled image is stored in the form of a matrix of pixel values by the MATLAB.

Once the screenshot is obtained, nine different points in the 9 boxes are chosen and processed as blank, O or X. For this game blank cell Red color value is - 255 (RGB) , O's cell R value is - 105 and X's cell R value is - 248.

Here 0 -> blank, 1 -> system's move and 2 -> player.

Minimax is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. Originally formulated for two-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty.

def min_max_move(instance, marker):
	bestmove = None
	bestscore = None
	
	if marker == 2:
		for m in instance.get_free_cells():
			instance.mark(m, 2)
			if instance.is_gameover():
				score = instance.get_score()
			else:
				mov_pos, score = min_max_move(instance, 1)
			instance.revert_last_move()

			if bestscore == None or score > bestscore:
				bestscore = score
				bestmove = m
	else:
		for m in instance.get_free_cells():
			instance.mark(m, 1)
			if instance.is_gameover():
				score = instance.get_score()
			else:
				mov_pos, score = min_max_move(instance, 2)
			instance.revert_last_move()

			if bestscore == None or score < bestscore:
				bestscore = score
				bestmove = m
	return bestmove, bestscore

from the result of algorithm tap position is calculated.

system(' adb shell input tap x y ');