Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

chemistry per player in less than 11 player #11

Open
motad333 opened this issue Sep 24, 2024 · 1 comment
Open

chemistry per player in less than 11 player #11

motad333 opened this issue Sep 24, 2024 · 1 comment
Assignees
Labels
question Further information is requested

Comments

@motad333
Copy link

motad333 commented Sep 24, 2024

hi
thanks for coding. its nice but i have issue.
i want to solve foundation sbcs . that required less than 11 player
For example, one of the puzzles requires 3 players and the chemistry is 1 for each player
and players must be 'LW' 'LM' 'ST'
how solve this puzzle with this solver?

@Regista6
Copy link
Owner

Which SBC is this ?

3 players --> Set NUM_PLAYERS = 3

Chemistry is 1 for each player --> Set CHEMISTRY = 0 and CHEM_PER_PLAYER = 1 and ensure PLAYERS_IN_POSITION = False

Players must be ['LW', 'LM', 'ST'] --> This seems like a weird requirement haha!

Before index is reset at the end in main.py in preprocess_data_2 you can add something like df = df.loc[df['Position'].isin(['LW', 'LM', 'ST'])]

Sometimes these foundations have requirement like Player Level: Exactly Bronze, for that you can do something like df = df[df["Color"] == "Bronze"] in main.py.

If all the 3 players need to be Common then just turn on create_rarity_2_constraint and set RARITY_2 = ["Common"] and NUM_RARITY_2 = [3].

Some work is required as you can see!

@Regista6 Regista6 self-assigned this Sep 25, 2024
@Regista6 Regista6 added the question Further information is requested label Sep 25, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
question Further information is requested
Projects
None yet
Development

No branches or pull requests

2 participants