A Tale of Two Searches: Bidirectional Search Algorithm that Meets in the Middle

Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/394

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mahanti, Ambuj
dc.contributor.author	Sadhukhan, Samir K
dc.contributor.author	Ghosh, Supriyo
dc.date.accessioned	2017-05-15T10:26:27Z
dc.date.accessioned	2021-08-26T03:56:21Z	-
dc.date.available	2017-05-15T10:26:27Z
dc.date.available	2021-08-26T03:56:21Z	-
dc.date.issued	2011-08-01
dc.identifier.uri	https://ir.iimcal.ac.in:8443/jspui/handle/123456789/394	-
dc.description.abstract	The Sliding Tiles problem (also known as n-puzzle) is quite popular as a problem testbed in AI. This problem is basically a game on a square grid, containing several tiles numbered consecutively from 1 to n and one blank space, such that n+1 is a square number. The blank space allows the movement of an adjacent tile to the blank position, thereby swapping the positions of the blank space and the tile. The objective of the n-puzzle is to arrive at a desired tile configuration (the end or goal state) starting from a given configuration (the start state), in a minimum number of moves.	en_US
dc.language.iso	en_US	en_US
dc.publisher	INDIAN INSTITUTE OF MANAGEMENT CALCUTTA	en_US
dc.relation.ispartofseries	WORKING PAPER SERIES;WPS No. 678/ August 2011
dc.title	A Tale of Two Searches: Bidirectional Search Algorithm that Meets in the Middle	en_US
dc.type	Working Paper	en_US
Appears in Collections:	2011

Files in This Item:

File	Description	Size	Format
wps_678_0.pdf		298.52 kB	Adobe PDF	View/Open