Artificial Intelligence Assignment 3

    0

    W6: Decision Trees
    Resources to consult:
    http://artint.info/html/ArtInt_178.html
    http://artint.info/html/ArtInt_48.html#gr
    Specific questions or items to address:
    In your own words describe the Decision Tree algorithm. Explain how we use binary trees to make predictions on new data.
    Create the function DecTree that will implement decision tree. Your function should accept input of decimal string (list) of repeated entries. Apply binary decision tree to find repetitions of each decimal digit in the string.
    Lets have n disks of graduated sizes: D1 D2 D3 Dn
    In addition lets have a 3 pegs on which those disk could be stacked on: 1 2 3
    If we know that all the disks are stacked on the peg 1 where the top disk is the smallest one while the bottom is the biggest implement the functionalities that will do the following:
    Move all the disks from the peg 1 to the peg 3 given that only one disk can be moved at a time and that no disk may be placed on top of a smaller one.
    Criteria: (# pages APA format etc.)
    Please use submit your assignment via a Word or Google doc with annotated screenshots where applicable.
    Your document should have the following components:
    Title page
    Course number and name
    Project name
    Student name
    Date

                                                                                                                                      Order Now