Group:cs20414
				Name:Deepak Kumar Singh
				Roll No.:01010105
				Assignment::5
		--------------------------------------------------
_______________________________
When my groupno. was cs20403:
-------------------------------

Assignment:1:-> In this assignment the strategy was to 
		find the move depending on the probability
		to win after a certain number of coins remaining.
		Before that we were using the hit and trial.

Assignment:2:-> In this assignment the main strategy was to
		match the particular type of coins remaining
		like triangular, rectangular  and so on.
		i.e. the pattern matching.

Assignment:3:-> This was the upgradation of the first program
		and the same recursion was used and the main algo
		was a minimax algorithm. But again due to similar
		searching the time taken by it was more than the limit.

___________________________________
When I changed my groupno. cs20414:
-----------------------------------

Assignment:4:-> In this assignment the strategy was to find the pattern
		from which I can win then according to that I move a random	
		move till the coins remaining was 6. After that i make a 
		pattern match and move the most winning  move.
		
			This game uses intelligent arrangement of coins.
		I have tried to utilize pattern matching for coins to 
		predict the next move.

Assignment:5:-> In this assignment the strategy is  I take set of all possible
		moves first then I found the moves which bears most points
		till there is 180 moves remaining. After that I use a recursion
		which can think upto a limited moves forward then the most
		wining move is moved without caring of points.

		In this program, i have used min-max algorithm. In the
		min-max algorithm used in the game, when the opposite user
		left the last coin, i return 1 and if that is my game, then i
		return 0. If in any path for opposite user getting 0 and 1, then i return
		the parent node 1 and if that is me, then i return 0 to parent
		node.