Skip to content

According to the Six Degrees of Kevin Bacon game, anyone in the Hollywood film industry can be connected to Kevin Bacon within six steps, where each step consists of finding a film that two actors both starred in. This program finds how many “degrees of separation” apart two actors are using Artificial Intelligence BFS Search Method For Problem …

Notifications You must be signed in to change notification settings

rajshree-v/Six_degrees_of_Kevin_Bacon

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Six_degrees_of_Kevin_Bacon

Artificial Intelligence Breadth First Search Method For Problem Solving is used for this program, so it behaves in an intelligent manner to be able to solve problems. Hence this program effectively is able to arrive at decisions that transform a given situation into a desired or goal situation. This is implemented in the degrees.py life in the shortest_path function.

The distribution code contains CSV data files in the large directory. In large/people.csv each person has a unique id, corresponding with their id in IMDb’s database. They also have a name, and a birth year. In large/movies.csv each movie also has a unique id, in addition to a title and the year in which the movie was released. In large/stars.csv relationship between the people in people.csv and the movies in movies.csv. Hence each row is a pair of a person_id value and movie_id value.

About

According to the Six Degrees of Kevin Bacon game, anyone in the Hollywood film industry can be connected to Kevin Bacon within six steps, where each step consists of finding a film that two actors both starred in. This program finds how many “degrees of separation” apart two actors are using Artificial Intelligence BFS Search Method For Problem …

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages