Othello | Othello game | Game Engine library

I need help with making tree from possible moves in game Othello, on which I will later use MiniMax algorithm. Game is played in Player vs AI mode and I am always "1" on board and AI is always "2" on board. This is how my current function for getting best move for AI looks like:

I have to do project for which I need custom function for hashing matrix. Project is about Othello (Reversi) game which means that I need to hash fixed 8x8 matrix.

This is how initializing matrix looks like:

I am writing a script and I have in the input 3 arguments - folder name, type file, word.
I want to search in the folder name in any type file and output the lines in those files that containing the word.
For example if in the folder_name I have those files: image.png con.txt file.jpg and the input is ./MyScript.sh folder_name txt hello and con.txt contains:

Creating a game called reversi also known as Othello and I am trying to add the starting position of my Black and Whites counters (using JLabel, labelled 'W' and 'B') in the middle of the board diagonally opposite from each other but for some reason only 2 show up and the other 2 don't show, which I don't understand why.

How do I go about fixing it?

Writing Othello with a twist: Only storing the black, white and the legal moves in Piece type lists.

I'm working on an Othello game in React and I've already implemented the code to switch player turns. It does switch from one to another(between white and black). But if there's no move available for the upcoming player, the turn stays the same. I though I had it all done but now I came across to such a case when trying out the game, and although it does switch player turns regularly, my code does not consider keeping it the same when necessary. Do you know why? How can I solve it?

Here's my code:

Where I change it:

I'm trying to code an Othello game, and now I'm trying to code the algorithm that does return the valid positions. I started by retrieving the directions of the empty squares where there's a black or white stone right next to it, but my code doesn't run. I don't know if I did something wrong but it seems that when I launch the program, the code runs slow because the algorithm is overkill. What can I do for that?

Here's my Code(By the way, I use React.js):

Here's the data structure of the square array:

I am writing an Othello game using Swing, here's the general code: (The snippet does not include the cases for game end/same player goes again, it's just the basic gameplay loop.)

View/Controller:

I have a problem about implementing recommendation system by using Euclidean Distance.

What I want to do is to list some close games with respect to search criteria by game title and genre.

Here is my project link : Link

After calling function, it throws an error shown below. How can I fix it?

Here is the error