Scribd Logo
Upload

Welcome to Scribd!

  • Black Paper

    Uploaded by

    ajaykumaryadav05032003
    5 views5 pages
    The document discusses graph search algorithms. It mentions breadth-first search (BFS) and brute force search techniques. It examines how to find the minimum number of steps to reach a target value starting from 1 by exploring neighbors level-by-level until the target is found.

    Original Description:

    Original Title

    Black Paper (21) (23)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses graph search algorithms. It mentions breadth-first search (BFS) and brute force search techniques. It examines how to find the minimum number of steps to reach a target value starting from 1 by exploring neighbors level-by-level until the target is found.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views5 pages

    Black Paper

    Uploaded by

    ajaykumaryadav05032003
    The document discusses graph search algorithms. It mentions breadth-first search (BFS) and brute force search techniques. It examines how to find the minimum number of steps to reach a target value starting from 1 by exploring neighbors level-by-level until the target is found.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    e

    BFS
    2 L
    a all which is
    already o
    O
    I I I O O
    has the ans
    -
    .

    -
    & 2 2
    I I I & &

    I I
    Brute
    - for - startlfs from
    -
    O I
    I I O value 1
    all with a .

    every
    =
    I

    O
    O I O O

    how multi suc

    I I I I I
    aft we
    by
    O's
    bys from -
    -

    JOIN THE DARKSIDE


    1197
    letcode
    --
    *⑧

    &-
    T

    * &
    -
    ↑
    min steps
    ↳real (i , 1)
    0 03
    fram L
    .

    -↓
    Bal
    -

    JOIN THE DARKSIDE


    JOIN THE DARKSIDE
    Ha
    Y X YX X
    far all the zeroes present an

    do dfAbts
    bonday
    a .

    Y
    X ↑Y X I

    set
    Y X X
    X
    Y & mark Her whole
    f
    Onighbor
    as don
    t
    XX &I +
    -
    X
    Y
    - ⑳ Y

    X Y X Y 0 1 -

    JOIN THE DARKSIDE


    JOIN THE DARKSIDE

    You might also like