Add Tic-Tac-Toe benchmark game to the project

[GorogPeter]

No description provided.

[zherczeg]

This code has a lot of ifs, that is good. What it does exactly? Tries all movements for all players and simply counts which one wins in which case?

[GorogPeter]

This code has a lot of ifs, that is good. What it does exactly? Tries all movements for all players and simply counts which one wins in which case?

The whoWillWin function decides who has a wining stragegy at a given game-state. First, if someone has won at the given game-state, it returns the winner. Else, if there's no empty place, it returns that there's no winner. If there's empty place, it tries them, and returns the best (best for the current player). To sum up, it implements the MiniMax algorithm.

[zherczeg]

LGTM

[clover2123]

Where did you get the source code of this benchmark?
I just wonder that there exist some collections of source code used for WASM testing

[GorogPeter]

Where did you get the source code of this benchmark? I just wonder that there exist some collections of source code used for WASM testing

I wrote it on my own.
So far, I don't know such a collection.

[clover2123]

LGTM