{"id":100438,"date":"2025-01-17T08:30:05","date_gmt":"2025-01-17T07:30:05","guid":{"rendered":"https:\/\/eiposgrados.com\/?p=100438"},"modified":"2025-01-09T16:50:51","modified_gmt":"2025-01-09T15:50:51","slug":"python-chair-game","status":"publish","type":"post","link":"https:\/\/eiposgrados.com\/eng\/python-blog\/python-chair-game\/","title":{"rendered":"The musical chair game with Python"},"content":{"rendered":"
\n

\u00a0The Python algorithm<\/strong><\/h2>\n<\/div>\n\n\n\n

We've just passed the Christmas season, filled with social events, lunches, and dinners with friends and family. Some of these events may be more about commitment than pleasure, and during which we often ask ourselves the following question: <\/p>\n\n\n\n

Who do I sit next to? <\/p>\n\n\n\n

Well don't worry, because since EIP International Business School<\/a> We'll give you a hand with that dilemma.  <\/p>\n\n\n\n

Here's a Python algorithm that will help you choose who to sit next to.  <\/p>\n\n\n\n

This algorithm takes into account various factors, such as your relationship with people, their interests, and whether they are good conversationalists.   <\/p>\n\n\n\n

We hope this helps. If so, please leave a comment to tell us about your experience. <\/p>\n\n\n\n

First, we define a list of family members and some attributes that may influence your decision. Then, the algorithm will evaluate each person and suggest the best option. <\/p>\n\n\n\n

# We define a class to represent each family member <\/p>\n\n\n\n

Family class: <\/p>\n\n\n\n

def init(self, name, relationship, interests, good_talker): <\/p>\n\n\n\n

self.name = name <\/p>\n\n\n\n

self.relation = relation <\/p>\n\n\n\n

self.interests = interests <\/p>\n\n\n\n

self.good_talker = good_talker <\/p>\n\n\n\n

# We create a list of relatives <\/p>\n\n\n\n

relatives = [ <\/p>\n\n\n\n

Familiar(\u201cUncle John\u201d, \u201cuncle\u201d, [\u201cfootball\u201d, \u201ctravel\u201d], True), <\/p>\n\n\n\n

Familiar(\u201cCousin Isabel\u201d, \u201ccousin\u201d, [\u201cart\u201d, \u201cmusic\u201d], True), <\/p>\n\n\n\n

Familiar(\u201cGrandma Maria\u201d, \u201cgrandma\u201d, [\u201ckitchen\u201d, \u201cgardening\u201d], True), <\/p>\n\n\n\n

Familiar(\u201cBrother Carlos\u201d, \u201cbrother\u201d, [\u201cvideo games\u201d, \u201cmovies\u201d], False), <\/p>\n\n\n\n

Familiar(\u201cAunt Mari \u00c1ngeles\u201d, \u201caunt\u201d, [\u201creading\u201d, \u201cwalks\u201d], True), <\/p>\n\n\n\n

] <\/p>\n\n\n\n

# Function to evaluate relatives <\/p>\n\n\n\n

def choose_side(relatives): <\/p>\n\n\n\n

best_option = None <\/p>\n\n\n\n

best_score = 0 <\/p>\n\n\n\n

for familiar in relatives: <\/p>\n\n\n\n

score = 0 <\/p>\n\n\n\n

# We increase the score according to the relationship <\/p>\n\n\n\n

if familiar.relation in [\u201cgrandmother\u201d, \u201cuncle\u201d, \u201caunt\u201d]: <\/p>\n\n\n\n

score += 2 <\/p>\n\n\n\n

elif relative.relation == \u201cbrother\u201d or relative.relation == \u201ccousin\u201d: <\/p>\n\n\n\n

score += 1 <\/p>\n\n\n\n

# We increase the score if they are good conversationalists <\/p>\n\n\n\n

if familiar.good_talker: <\/p>\n\n\n\n

score += 2 <\/p>\n\n\n\n

# We increase the score if they share interests <\/p>\n\n\n\n

if \u201ccooking\u201d in familiar.interests or \u201cvideo games\u201d in familiar.interests: <\/p>\n\n\n\n

score += 1 <\/p>\n\n\n\n

# We check if this option is better than the previous one <\/p>\n\n\n\n

if score > best_score: <\/p>\n\n\n\n

best_score = score <\/p>\n\n\n\n

best_option = family <\/p>\n\n\n\n

\"Python\"<\/figure>\n\n\n\n

If you want to learn how to create your own algorithms and develop your own applications, do not hesitate and ask for information at EIP International Business School<\/a>.\u00a0<\/p>","protected":false},"excerpt":{"rendered":"

\u00a0The Python algorithm We have just spent the Christmas season, full of social events, meals, dinners with friends and family, some of which are \u2026 Read more<\/a><\/p>","protected":false},"author":4227,"featured_media":100477,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"inline_featured_image":false,"footnotes":""},"categories":[407],"tags":[1528],"class_list":["post-100438","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blog-python","tag-algoritmo"],"acf":[],"_links":{"self":[{"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/posts\/100438","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/users\/4227"}],"replies":[{"embeddable":true,"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/comments?post=100438"}],"version-history":[{"count":0,"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/posts\/100438\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/media\/100477"}],"wp:attachment":[{"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/media?parent=100438"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/categories?post=100438"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/eiposgrados.com\/eng\/wp-json\/wp\/v2\/tags?post=100438"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}