Decision Tree.

Binary Trees (Decision Trees)

This introduces you to the concept of machine learning and gives you a peek to how Amazon’s Alexa, for example, improves itself.

In this, you will implement a variant of the 20 questions game that you will play with the computer. You (the user) will first think of an animal and the computer will try to guess the animal. The computer is allowed at most 20 questions it can ask the user to enable it to guess correctly. The response of the user must be either “yes” or “no”. For the purposes of this homework, we will not put a limit on the maximum number of questions allowed.

To play this game, you will need to implement a decision tree which is a binary tree with the left branch indicating “yes” and the right branch indicating “no”. For the purposes of this homework, we will restrict our objects to animals. The leaves of the decision tree will be animals and the internal nodes will be the attributes that distinguish the animals. At the start of the game, the decision tree will contain only one node which will be a leaf node containing an animal – in our example we started with “snake”. If the computer guesses wrong, it will ask the user to give an attribute that distinguishes the animal the user has in mind (with a “yes” for that attribute) from the animal the computer guessed (with a “no” for that attribute) and it will update the tree accordingly. This allows the computer to “learn” dynamically as the game progresses.

Programare C++ Algoritm

ID Proiect: #22007235

Detalii despre proiect