Indivisible homogeneous directed graphs and a game for vertex partitions

Let T be a set of finite tournaments. We will give a necessary and sufficient condition for the T-free homogeneous directed graph HT to be divisible; that is, that there is a partition of HT into two sets neither of which contains an isomorphic copy of HT.