Traveling Sales Person Problem and Today’s Questions

To resolve this problem, first I make an Adjacency Matrix. Then, I assign numbers for each path. After, I find the least valuable numbers for the paths (without repeating paths), and then I add the numbers for the shortest way.

Map

QUESTIONS

What is a Karnaugh Map?

A Karnaugh map is a way to simplify complicated equations in the Boolean Algebra.

_________________________________________________________________________________________

Give examples of digital and analog.

Analog:

PERRITOOOOOOO

Digital:

DIGITAL CLOCK

_________________________________________________________________________________________

What is the difference between digital and analog?

That analog is continuous and digital isn’t continuous.

_________________________________________________________________________________________

What is a game tree?

A game tree is a way of finding the best choice for one to win a game

Screen shot 2014-01-16 at 5.36.11 PM

 

_________________________________________________________________________________________

Why do computers use game trees?

Computers use game trees to analize the consequence of each action that you make in the game so they can choose the best one to beat their opponent.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s