Optimal algorithm of behaviour: t:=1 If a prisoner observes t–1 black disks, he goes out at period t announcing a black disk. If not, he stays in the game ...
確定! 回上一頁