Code covered by the BSD License

Be the first to rate this file! 1 Download (last 30 days) File Size: 18 MB File ID: #25724

AI for a game called chomp

03 Nov 2009 (Updated 14 Jun 2012)

this program uses the minimax algorithm for playing chomp.open the file create_tree for instrutions.

File Information
Description	Chomp: Draw a nxm grid, Number the elements from the 1 to mn starting from the top left and going row wise. now You and the computer will take turns choosing numbers from 1 to mn. When a cell is selected, all the existing cells above AND on the right are removed, The player left with only the bottom left element losses. http://en.wikipedia.org/wiki/Chomp
MATLAB release	MATLAB 7 (R14)

Tags for This File
Everyone's Tags	algorithm, chomp, game(2), minimax, puzzle
Tags I've Applied
Add New Tags	Please login to tag files.

Please login to add a comment or rating.

Comments and Ratings (1)
22 Mar 2013	John	Hi Abhilash, Recently I made a perfect AI for arbitrarily large chomp grids, for example, all solutions to a 10x10 game of chomp can be calculated in ~ten seconds. I was wondering if your program also has a 'perfect' AI? ie. An AI that will never lose if it is the first player.

Updates
04 Nov 2009	open create_tree.m for instructions.
04 Nov 2009	better description of rules.
14 Jun 2012	Improved description