8x8 | Direct drive LED 8x8 matrix for Arduino

I posted a similar question to this one a few weeks ago where I had trouble finding the data race in my N-queens program using pthreads in C. Why is my multithreaded C program not working on macOS, but completely fine on Linux?

I got a few suggestions in the comments sections of the post and I really tried my best to make corrections based on them. I sat with the suggestions a few days, changed some parts but the data race persisted and I just cannot understand why. There are counters inside critical sections for the number of productions and consumptions. I feel completely blind when looking through the code and analyzing it, I'm aware that consumptions are too many but the synchronization around that code fragment should with my knowledge be correct, but obviously something's not right. External input would be greatly appreciated.

This is the code I'm using and I'm not sure how to reduce its size to still reproduce the issue. I compile it with gcc (clang-1205.0.22.11) on macOS Monterey (12.1) using a MacBook Pro 2020 x86_64 architecture.

compile: gcc -o 8q 8q.c*
run: ./8q , NxN chess board, N queens to place
parameters: ./8q 2 4 Enough to highlight the problem (should yield 2 solutions, but every other run yields 3+ solutions, i.e duplicate solutions exist
note: running the program with ./8q 2 4 should give 2 solutions, 1820 productions and 1820 consumptions.

I converted an avi file to a mp4 file with the following command, but the converted mp4 file produced no audio when played with QuickTime (no such problem with other players). I was able to convert mkv to mp4 with the same command without the audio problem.

I am using a for loop to populate an 8x8 grid with two different buttons randomly. I have an array of instances of the buttons and for some reason, it is only giving me one of each button and not populating the rest of the grid with anything. Any advice? I included only the buildPanel block of the code but I do have separate classes for the buttons and the Game class. I also have the rest of the code somewhat done. It doesn't fully do what I need yet and needs to be cleaned up but if it might be helpful in solving this issue, I can post it. I'm unable to post more code than this in the question without writing more details but it's pretty straightforward of a question I think.

I'm trying to initialize an "empty" array with each elements containing t_list a 8x8 np.zeros array :

t_list = np.zeros((8,8), dtype=np.float32)

I would now want to have a np.array with multiple t_list at each indexes:

result = np.array((t_list, t_list, ...., tlist))

I would like to be able to control the number of time t_list is in result.

I know that I could use list instead of arrays. The problem is, I put this in a numba njit function so I need to precise everything.

The aim is then to change each values in a double for loop.

I am trying to figure out the layout for this(the rest of the code is in the early stages) but for this block, I am trying to figure out the best(and doable) way to format it. I want it to be an 8x8 grid that I will eventually populate with the treasure/empty buttons but I also need a title up top as well as some labels and text on the left. I am unsure if I am able to do multiple grids but what I did below is try to create a 1x2 grid and then place two other grids inside, one with the info on the left(3x2), and another with the 8x8 grid for the buttons. I know it's not close to what it needs to be but none of the grids are showing up at all(it's just putting the title and then one column with 8 rows) and I wanna know if I'm even on any sort of right track, or if I'm just making things up at this point. Any tips would be appreciated, or resources about possibly nesting the grids? I can't find anything in my book about That specifically.

I use this reverse-bit method of iteration for rendering tasks in one dimension, the goal being to iterate through an array with the bits of the iterator reversed so that instead of computing an array slowly from left to right the order is spread out. I use this for instance when rendering the graph of a 1D function, because this reversed bit iteration first computes values at well-spaced intervals a representative image appears only after a very small fraction of all the values are computed.

So after only a partial rendering we already have a good idea of how the final graph will look. Now I want to apply the same principle to 2D rendering, think raytracing and such, the idea is having a good overall view of the image being rendered even from an early stage. The problem is that making the same idea work as a 2D iteration isn't trivial.

Here's how I do it in 1D:

Here is an 8x8 table of 64 cells, each containing a number

I'm hoping to speed up this matrix-vector product using AVX-1 or earlier instructions:

I want help in maxpooling using numpy. I am learning Python for data science, here I have to do maxpooling and average pooling for 2x2 matrix, the input can be 8x8 or more but I have to do maxpool for every 2x2 matrix. I have created an matrix by using