CS188.1x - Revision history

Tim at 02:21, 15 October 2012

2012-10-15T02:21:26Z

← Older revision		Revision as of 22:21, 14 October 2012
Line 9:		Line 9:
	:x-->y		:x-->y
	For every x domain value in the tail is there a is there some y domain value that can meet the constraints. If not then remove those values from x.		For every x domain value in the tail is there a is there some y domain value that can meet the constraints. If not then remove those values from x.

			Project 1, I need a general pacman narrrative,

			like ... Pacman initalizes by creating ??? object which creates a ???? and ???? object. The ???? object gets most of its functionality from ???? inherited from ????? The ???? contains ????? and allows your to ?????.
			Or maybe some comments that tell where these functions come from.

			As it is I've gotten to A* which seems to work but the grader doesn't think so.

			So cornersProblem takes this search.searchProblem abstract class as an input, to what end I'm not sure. Magically it initializes by calling startingGameState from I'dont know where.

			I'm stuck in a code maze.

Tim at 20:12, 14 October 2012

2012-10-14T20:12:16Z

← Older revision		Revision as of 16:12, 14 October 2012
Line 1:		Line 1:
	====constraints====		====constraints====
			back to [[edx]]
	;unary constraint: is a constraint on a single variable (e.g., X≠4).		;unary constraint: is a constraint on a single variable (e.g., X≠4).
	;binary constraint: is a constraint over a pair of variables (e.g., X≠Y).		;binary constraint: is a constraint over a pair of variables (e.g., X≠Y).

Tim at 13:44, 14 October 2012

2012-10-14T13:44:29Z

← Older revision		Revision as of 09:44, 14 October 2012
Line 7:		Line 7:
	====arc constraints====		====arc constraints====
	:x-->y		:x-->y
	For every x-value in the tail is there a is there some y-value that can meet the constraints. If not then remove those values from x.		For every x domain value in the tail is there a is there some y domain value that can meet the constraints. If not then remove those values from x.

Tim at 13:43, 14 October 2012

2012-10-14T13:43:32Z

← Older revision		Revision as of 09:43, 14 October 2012
Line 3:		Line 3:
	;binary constraint: is a constraint over a pair of variables (e.g., X≠Y).		;binary constraint: is a constraint over a pair of variables (e.g., X≠Y).
	;k-ary constraint has a scope of size k.		;k-ary constraint has a scope of size k.
			;variables:
			;domains: the set of values a variable can take
	====arc constraints====		====arc constraints====
	:x-->y		:x-->y
	For every x-value in the tail is there a is there some y-value that can meet the constraints. If not then remove those values from x.		For every x-value in the tail is there a is there some y-value that can meet the constraints. If not then remove those values from x.

Tim at 13:41, 14 October 2012

2012-10-14T13:41:49Z

← Older revision		Revision as of 09:41, 14 October 2012
Line 1:		Line 1:

	====constraints====		====constraints====
	;unary constraint: is a constraint on a single variable (e.g., X≠4).		;unary constraint: is a constraint on a single variable (e.g., X≠4).
	;binary constraint: is a constraint over a pair of variables (e.g., X≠Y).		;binary constraint: is a constraint over a pair of variables (e.g., X≠Y).
	;k-ary constraint has a scope of size k.		;k-ary constraint has a scope of size k.
			====arc constraints====
			:x-->y
			For every x-value in the tail is there a is there some y-value that can meet the constraints. If not then remove those values from x.

Tim: Created page with " ====constraints==== ;unary constraint: is a constraint on a single variable (e.g., X≠4). ;binary constraint: is a constraint over a pair of variables (e.g., X≠Y). ;k-ary c..."

2012-10-13T19:13:11Z

Created page with " ====constraints==== ;unary constraint: is a constraint on a single variable (e.g., X≠4). ;binary constraint: is a constraint over a pair of variables (e.g., X≠Y). ;k-ary c..."

New page

====constraints====
;unary constraint: is a constraint on a single variable (e.g., X≠4).
;binary constraint: is a constraint over a pair of variables (e.g., X≠Y).
;k-ary constraint has a scope of size k.