回複：回複：回複：there is a solution

來源: guest007 於 2010-03-12 15:43:44 [] [舊帖] [給我悄悄話] 閱讀數 : (407 bytes)
回答: 回複：there is a solution 由 guest007 於 2010-03-12 11:33:50

well, i do not have any idea how this can be done though- below are from wiki

Five players and more
In 1995 Brams and Taylor devised an envy free procedure for any number of people. This is discrete but the number of cuts is unbounded, it is not determined in advance.[3]

For five or more players the only known algorithms have no fixed bound on the number of cuts required.



請您先登陸，再發跟帖！