An enhanced version of the 24-game solver using recursive search and pruning.

This program allows users to solve the 24-game using the following features:

• Recursive search with pruning
• Progress bar to monitor search progress
• OpenMP parallelization for multi-core systems
• Optimization for commutative operations (addition and multiplication)

Users can either use default settings or customize them according to their needs. The program outputs include:

• The first valid solution for 24
• Detailed recursive steps and expressions

Additionally, the program supports solving the game with varying number of inputs and halts upon finding a valid solution.

Key Features

• Implements recursive search for the 24-game
• Supports up to 8 input numbers
• OpenMP for parallelization on larger input sizes
• Progress bar for visual feedback during the search process

How to Use

1. Compile the program with OpenMP support (gfortran -fopenmp).
2. Enter the number of numbers (between 1 and 8).
3. Provide the input numbers or card values (A=1, J=11, Q=12, K=13).
4. View the solution if found, or a message indicating no solution.