This study focuses on the fact that there are n professors holding a meeting at a round table, where each professor has his/her own number (1 ~ n), and the n positions of the round table also have their own nametag numbers (1 ~ n) placed on the table in a clockwise manner corresponding to the professors' numbers. The first professor who enters the table, No. 1, is seated at position k. Subsequent professors enter the table one by one in a random order, and if they find that the position with the same number as theirs is empty, they will be seated directly; if the position with the same number as theirs is occupied, they will look for an empty seat in the counterclockwise direction until there is an empty seat. Under such a game rule, this study investigates how, with n professors and professor number 1 seated in seat k, given a group of professors' order of entry, we can immediately find out the corresponding seating method, as well as explore the distribution table of the number of wrong seating times and the expected value of the number of wrong seating, etc. The game rule is then changed to a new rule. Later on, we will change the rules of the game so that Professor 1 is not limited to be the first one to enter the game, and we will explore the above problems as well.