freecell | A freecell implementation that does not show you ads

Brief recap: I have a C++ multithreading sudoku solver, for which I want to improve the efficiency, i need your help.

I'm implementing a brute force sudoku solver in multithreading in C++. The main struct is a tree and the all logic is this: I start reading the initial matrix in input and this will be my root node, then I find the first empty cell, I find all the possible numbers that could fit that position, and for each possibility I create a sub-node of the parent node, so that each node will have a child-node for each possible number. The tree continues to grow in this way until a solution is met, that is a node has no more free cells(so it is full), and the node grid satisfy all the rules of the sudoku.

I tried to implement this algorithm in multithreading like this: I follow the exactly same logic of above sequentially but making one step each time, storing all the children I have met until that moment (each child will be a path, and so a tree) in a vector. If the children are less than the threads chosen by the user, then I solve them sequentially and I make one more step(children will grow). When I have more children than threads, then I split the children for each thread, and I start the threads each one with his part(that is a tree).

Now, taking into account that the "brute force" approch and that "only std lib" requirements are mandatory, so I can't do in a different way, but I can change of course the logic on how to implement this.

The question is: how can I improve the efficiency of this program ? All the suggestions that uses only std lib are welcome.

The thing is, that Junit compares these map results as object instance and hence fails the test all the time, even if Lists contains right arrays of ints coupling with right Enum. My code is smth like that, and I want Assert to return true.

I have been trying to scrape a specific page for a couple of days, to no avail. I am a noob both in scraping, and Python.

I am really looking for the last, large table of the page, but there aren't IDs to rely on, so I tried to scrape all tables.

I came up with this code:

I have a class "CardT" the contains a suit and number stored by an enum value. For the use of solitaire i create a deck of 52 of these cards with each value. I also have a "tableau" class that stores a set of these cards for the solitaire tableau, my board class contains an array of 8 of these. After placing the values in the array and printing to check for correctness, it gives a correct output. But if i then call another function right after that prints the exact same thing, i get very different values.

I want to compare two txt files with process information in PowerShell. I looked up plenty of websites and there is always this simple

I've been trying so solve the Freecell Solitaire game with a DFS for well over a month now with only partial success. I'm a novice, with a non-CS background, that used classes and recursion for the first to solve a problem, mainly trying to imitate what I found through Google-searches and Stack Overflow posts. (general comments on code clarity etc are more than welcome)

The code for the game is here: https://pastebin.com/39KGZAW1, which I hope is understandable. The idea behind it is:

• Create instances of the Board (class), something like snapshots in the game
• Find all possible moves
• Create one new instance per move and update (class function) the board with that move

The problems are:

• It seems to be taking too long (the computer ran out of memory when I tried saving every board, so I stopped and used a generator and a deque), never finding a solution
• When I tried using mini_stacks (a card deck with less than 13 cards, currently just 1s and 2s!) it doesn't seem to be finding any solutions either.
• The recursive approach seems faster (at least comparing how many Boards instances are created) than the two implementations of the while-loop

More details: After the game logic is coded, I mainly tried two approaches to the DFS. The first was with a recursive function: