UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 3 | March 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 9 Issue 7
July-2022
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR2207036


Registration ID:
405353

Page Number

a286-a290

Share This Article


Jetir RMS

Title

A Case Study of Fifteen Puzzle Problem Using BFS & DFS

Abstract

BFS is a graph traversal algorithm [2] that begins at the root node and travels the graph to all of its neighbour. DFS (Depth-First Search) is a graph-searching technique that begins at the top and works its way down until it discovers the required node or the node with no children. On tough issues, best-first search frequently has exponential space needs. Although DFS can tackle tough problems with linear space needs, it cannot take advantage of the vast amounts of additional memory available on today's computers. We review the question of whether to utilize best-first or depth-first search. For the first time, using classic BFS, it was possible to uncover optimal solutions to specified difficult difficulties (the whole benchmark set of Fifteen Puzzle issues) thanks to algorithmic innovations (with the Manhattan distance heuristic only). Due to its exponential space requirements, it was believed that this search strategy couldn't solve randomly generated Fifteen Puzzle instances when practical resource restrictions applied.The result, of case study demonstrates that, when hardware and algorithmic advances are combined, the earlier assessment of best-first search can be revised.

Key Words

BFS, DFS, Manhattan Distance Heuristic.

Cite This Article

"A Case Study of Fifteen Puzzle Problem Using BFS & DFS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.9, Issue 7, page no.a286-a290, July-2022, Available :http://www.jetir.org/papers/JETIR2207036.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"A Case Study of Fifteen Puzzle Problem Using BFS & DFS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.9, Issue 7, page no. ppa286-a290, July-2022, Available at : http://www.jetir.org/papers/JETIR2207036.pdf

Publication Details

Published Paper ID: JETIR2207036
Registration ID: 405353
Published In: Volume 9 | Issue 7 | Year July-2022
DOI (Digital Object Identifier):
Page No: a286-a290
Country: Hubli - Dharwad, Karnataka, India .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

000191

Print This Page

Current Call For Paper

Jetir RMS