Implement groups

[Viq111]

Progress:

• [x] Split
• [x] Objectives
• [x] Join
• [x] Main thread

  Split

• When an objective is chosen, check three nearest objectives from it
• If us > max(nb_obj, max(nearest_nb) - nb_obj)), create a group with the difference (max-us)
• This group check a nearest free objective:
  • If one is available create a new thread, tell the goal is nearest neighbor and do the same algo
  • else do not split

    Objectives

• Each thread do a Negamax()
• Each thread return to the main a list of goals he has chosen and their order (score)

  Join

• If there is no free objectives, put a flag as joining parent

  Main thread

• First the root group moves, then each one with the highest score
• If one of them has no objective, set a flag to return to parent
• Create a list of moves, first the root, then each children with its goal

[Viq111]

@Arkelenia Si tu penses que j'ai mal compris certains points, n'hésite pas ;)

[Viq111]

@Arkelenia @AurelienBobey @damv @olivielpeau

Pylight V3.0 - The Next Gen !

Vous pouvez tester, vous defouller et surtout trouver les bugs, mettez les maps sur lequelles ça bug, si pylight joue en premier ou deuxième et contre qui ;)