labyrinth | Small game implemented in Win32 for game programming course | Game Engine library

I'm building one of my first Python apps and am looking for some advice understanding google oauth and related app design patterns. My primary goal is to build an app that polls my Nest for data and learn to do so securely. Using google's API and oauth2 Python libraries, I've successfully created a tiny Flask app that will return data from a google API along with an auth token + refresh token. The core functions look something like this:

I'm making a game, a labyrinth, where you have to collect 10 pickups to win the game. Some of those pickups will be always in the same places, but there are others that will spawn in a random position at the start using a for-loop (previously declared in the code all the possible options). The idea is, when an element has been spawned, the Vector3 containing that position has to be deleted from the List, so it cannot be spawned again in the same place.

I've tried doing it with arrays, but I couldn't delete that value easily, so I decided to try Lists. I've found this post aiming to use Lists and giving a solution, but when I'm trying it isn't working. The pickups aren't being spawned, but I cannot manage to find the error.

Here's the code:

I've been trying to make a text-based game using a Javascript Discord Bot, and I can't figure out how to make the bot send a message upon the user sending a reaction (i.e. player reacting to bot message with a certain emoji).

Let's consider a "maze" defined by a string, for example

I used the percolation class from the algs4.jar library, where you can simulate a whole labyrinth and see where the leaks are. I want to show the leaks that are from top to bottom, but now I get to see all of the leaks.

Does anyone know how I can see only the leaks that are percolations?

I thought maybe using dfs from the flow method in de Percolation.java class, and say something like only show when index i in rows is maxlength and marked but I don't really know how to say that, because I am not sure if this statement will show the entire leak of just the max length leak.

code I run AssignmentTwo.java:

I have a maze vector of vector of ints and a pointer line to that vector declared as follows. I also have a pointer to line that identifies each element in particular.

In a canvas project I am working on, I have a tile based gird, along with a panel of options. I have gotten everything to work, and all the images are crisp, screen resizing is accounted for, there is no anti-aliasing, etc. Everything (graphics wise) is perfect, the problem is that sometimes I need to change the number of rows and columns, and this changes the overall dimensions of the canvas. Due to some other problems, I use a buffer canvas inside of the editor class, which gets rendered onto the main canvas.

Here is my editor code (only the graphics):

I need help with prolog problem.

The text of problem is: Write a predicate Prolog called Labyrinth(Lab, From, To) that receive in input a labyrinth, initial position and end position and print the list of possible moves (up,right, bottom, left). The labyrinth is a 7x7 matrix with list of rows and list of columns. Each cell contains 'w' if is a wall, otherwise 'e' if empty. the start and end position are describe with a function in/2 that have for arguments a row and column.

This is an example of matrix (index start at 0)

I'm trying to do a maze resolver with a cellular automaton but I have a display problem for each new generation of a grid of an automaton we try to display the cells in the form of rectangle.The initialization works well and the grid is displayed,the last generation of the simulation is displayed too but not the intermediate steps.

pic of first generation

last generation