<p>Both are true: if you try all the paths or just the right one, in the end you'll have the same result.</p>

CC BY-SA 3.0
2015-12-13T21:13:40.027Z
thank you i guess i just needed that , your simple answer clarified it for me , i was so confused
CriminalDuck
CC BY-SA 3.0
2015-12-13T21:31:16.280Z
Please don't answer clearly off-topic question.
Kaveh
CC BY-SA 3.0
2015-12-13T20:47:38.293Z
2015-12-13T20:47:38.293Z
unautre
<p>i'm confused since i see some books mention the NP time algorithms as "very lucky" that means it always finds the right path? also can someone explain the coming points to me please...</p>

<hr>

<p>A nondeterministic computation is viewed as:<br>
(i) when a choice point is reached, an infallible oracle can be
consulted to determine the right option.
(ii) When a choice point is reached, all choices are made and
computation can proceed simultaneously.</p>

<p><strong>thank you in advance , i kinda need to get clear about what NP is about</strong> </p>

CC BY-SA 3.0
2015-12-13T21:30:48.930Z
This is off-topic for this site. Please read [tour] and [help/on-topic]. It might be suitable for [cs.se] which has a broader scope.
Kaveh
CC BY-SA 3.0
2015-12-17T20:33:19.727Z
A nondeterministic algorithm is an algorithm in which choices are left open; they will need to be made while executing and the algorithm doesn't tell you how. Such an algorithm is said to accept a string it it reaches an accepting state for certain combinations of choices. It's not the algorithm, but the combination of choices made when executing it that needs to be "lucky" in order to end up in an accepting state.
reinierpost
<np>
non deterministic algorithm always find the right solution?
CriminalDuck
# non deterministic algorithm always find the right solution?

(Asked by: username_0 on 2015-12-13)

i'm confused since i see some books mention the NP time algorithms as "very lucky" that means it always finds the right path? also can someone explain the coming points to me please...

---

A nondeterministic computation is viewed as:  
(i) when a choice point is reached, an infallible oracle can be
consulted to determine the right option.
(ii) When a choice point is reached, all choices are made and
computation can proceed simultaneously.

**thank you in advance , i kinda need to get clear about what NP is about**

**Tags:** np
> **Comments:**
> **username_1**: This is off-topic for this site. Please read [tour] and [help/on-topic]. It might be suitable for [cs.se] which has a broader scope.  
> **username_2**: A nondeterministic algorithm is an algorithm in which choices are left open; they will need to be made while executing and the algorithm doesn't tell you how. Such an algorithm is said to accept a string it it reaches an accepting state for certain combinations of choices. It's not the algorithm, but the combination of choices made when executing it that needs to be "lucky" in order to end up in an accepting state.  

---

## 1 answers

### Answer by username_3 on 2015-12-13. Score: 0 | Accepted answer

Both are true: if you try all the paths or just the right one, in the end you'll have the same result.

> **Comments:**
> **username_0**: thank you i guess i just needed that , your simple answer clarified it for me , i was so confused  
> **username_1**: Please don't answer clearly off-topic question.  

---

