Othello | An advanced AI to play the 2-player board game Othello | Game Engine library

I am programming an othello bot in python using reinforcment learning and pytorch. In the program, I scan the board for legal moves. The AI should choose the move with the highest probability of beeing good, and that is legal according to the previose calculation. Here I need a function that works something like this:

Is it possible to make a search to a virtual column that is composed by two columns?

Let's say I have the following MongoDB collection:

Quick disclaimer that this is for a homework task so rather than me placing any code I wanted to get conceptual help from you guys, maybe examples to help me understand. Essentially we have to implement an ai for reversi/othello and while minmax is the final goal, I wanted to start with a greedy algorithm.

Ok so the relevant definitions/functions:

GameState - this variable holds the boundaries of the board, who's turn it is, and the board (with a list of Maybe Player where Nothing means the tile is empty and Maybe Player1 or Player2 which means a piece is present for a player.

legalMoves - returns a list of all possible legal moves when given a GameState. Here a move is defined as a position (x,y)

applyMove - finally we have applyMove which takes a GameState and a move and returns a new Maybe GameState based on the new board after that move was played.

The final goal here is to create a function that when given a GameState, returns the best move

What I've done: Firstly, I've created an evaluation function which returns the eval of any GameState (eval :: GameState -> Int). So a heuristic.

From here I've had trouble. What I've tried to do is map the applyMove func to legalMoves to return a list of all possible future GameStates given a GameState. Then I mapped my eval func to the list of GameStates to get a list of Int's then I finally took the maximum of this list to get the best evaluation. The problem is I'm not sure how to go back to the actual move from legalMoves that gave me that evaluation.

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: