How to solve this problem within polynomial time complexity?

Revision en1, by include_c, 2024-10-18 04:11:17

Given a rooted tree with all white dots initially, A can choose one dot at a time, and then B chooses whether to dye the chain from the root to that point black or the subtree at that point black. Until the tree is covered in black dots. A's goal is to minimize the times of choices, while B's goal is to maximize the times of choices. Ask this times of choices.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English include_c 2024-10-18 04:11:17 422 Initial revision (published)