/******************************************************************************
 *  Name:     
 *  NetID:    
 *  Precept:  
 *
 *  Partner Name:       
 *  Partner NetID:      
 *  Partner Precept:    
 *
 *  Hours to complete assignment (optional):
 *
 ******************************************************************************/

Programming Assignment 4: 2048


/******************************************************************************
 *  Explain briefly how you represented the Board data type.
 *****************************************************************************/




/******************************************************************************
 *  Explain briefly how you represented a search node
 *  (what fields are included in the nodes).
 *****************************************************************************/







/******************************************************************************
 *  For each of the following goal values, give the number of moves and time
 *  needed to solve Board1.txt (which is a starting board with only a 2 in the
 *  top right corner). Do this for both the leftWeightedScore and
 *  distanceWeightedScore priority functions. If your program can't solve the 
 *  instance in a reasonable amount of time (say, 5 minutes) or runs out of memory, 
 *  indicate that instead. Note that these values may differ based on the way
 *  neighbors is written so you will not necessarily have the same answers as
 *  other students.
 *****************************************************************************/


                      # of moves                seconds
    goal value   Distance    Left          Distance    Left
		 Weighted    Weighted	   Weighted    Weighted
   ------------  ---------   ----------    ---------   ----------
   128 
   256 
   512 
   1024 
   2048 
 



/******************************************************************************
 *  If you wanted to solve random 4-by-4 puzzles with a goal of 2048, which
 *  would you prefer: a faster computer (say, 2x as fast), more memory
 *  (say 2x as much), a better priority queue (say, 2x as fast),
 *  or a better priority function (say, one on the order of improvement
 *  from Distance Weighted Score to Left Weighted Score)? Why?
 *****************************************************************************/






/******************************************************************************
 *  Known bugs / limitations.
 *****************************************************************************/



/******************************************************************************
 *  Describe whatever help (if any) that you received.
 *  Don't include readings, lectures, and precepts, but do
 *  include any help from people (including course staff, lab TAs,
 *  classmates, and friends) and attribute them by name.
 *****************************************************************************/





/******************************************************************************
 *  Describe any serious problems you encountered.                    
 *****************************************************************************/



/******************************************************************************
 *  If you worked with a partner, assert below that you followed
 *  the protocol as described on the assignment page. Give one
 *  sentence explaining what each of you contributed.
 *****************************************************************************/




/**********************************************************************
 *  Have you completed the mid-semester survey? If you haven't yet,
 *  please complete the brief mid-course survey at https://goo.gl/ecqeUV
 * 
 ***********************************************************************/



/******************************************************************************
 *  List any other comments here. Feel free to provide any feedback   
 *  on how much you learned from doing the assignment, and whether    
 *  you enjoyed doing it.                                             
 *****************************************************************************/
