Brainf*** code golf challenge - write a Brainf*** program that searches for the first non-zero cell

Question

The challenge is to write a brainf*** program that searches sequentially through memory for the first NON-zero cell.

The program should start somewhere in fairly low memory (there will probably be some overhead/counters/etc.). Once the program starts checking cells, it should continue to the right, checking every cell in sequence until it reaches the first non-zero cell, then stop.

Testing will be performed for several random cells and values. Examples might look like: m(13) = 1, or m(144) = 137, or m(983) = 231. The actual values will be randomly generated once and used for all entries. The cell values of 1 and 255 will also be tested.

Scoring - different from the usual
- code golf, lowest score wins
- in the case of a tie, earlier entry wins
- any continuous series of identical commands that changes pointer position or cell value counts as 1 point.

>                           1 point  
> >                         1 point  
> > > > > > > > > > > > > > > > > > > > > > > > > > 1 point  
< < < < < < < < < < <       1 point  
+ + + + + +                 1 point  
- -                         1 point  

[       opening a loop = 1 point  

]       closing a loop required, so 0 points  

one point for EACH input or output  
. .             2 points  
. . . . . .     6 points  
,               1 point  
, ,             2 points (not that anyone would ever do this)  

The python 3 program I will use for scoring is found here:
http://pastebin.com/RJi72BHa

Answer 1

11 24 Points

Edit: Now, we do not change the value that is there and do not output it. This now behaves as expected for 255 as well.

+[-[[-<<+>>]<<+>>-<]>+]-<<[->>+<<]>>

This program searches for the first non-zero byte and exits. We expect the first value pointed at to be 0, and we require that the pointer be at least at cell 1 to begin with ("The program should start somewhere in fairly low memory"). Here's a little test, no funky interpreter required:

[ Search for the first non-zero cell            ]
[ http://codegolf.stackexchange.com/q/54432/31054   ]

[We require moving one cell to the right from the left end ] >

[Testing code: ]
>>>>>>>>> [... any number of > ...] >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
[ASCII code '0'] ++++++[-<++++++++>]
<<<<<<<<< [... the same number of < ...] <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<


[Find it and stop:  ]
+[-[[-<<+>>]<<+>>-<]>+]-<<[->>+<<]>>



>[Output, for checking: ]<
.   

Example run:

~ Me$ bf f.bf
0

Answer 2

Command count: 12
Golf score: 10
+[-[<-<]>+]>
This is my first attempt for a Brainfuck program
This seems to work fine. the program was inspired from the answer of Brainsteel(Though seems to be highly optimized and hardly the same program)
My first attempt(Without brainsteels answer also it solves the negative 1 problem in brainsteel and my answer) was:
+[>[[<+>-]>]<[->+<]>]<<[->+<]>-
With Command count: 31
Golf score: 25

Answer 3

18 bytes, 15 points

>+[>[<-]<[->+<]>]>

Code requires to have at least two 0s before searched value. It finds any number, even -1 and doesn't change it.

Answer 4

12 bytes, 8 points

+[-->>[<]<+]

• Does not change the non-0 cell value
• Does not work if the non-0 cell is the 1st or 2nd cell
• Stops on the second cell before the non-0 cell (e.g. [][][pointer][][non-0][][])

or... +[-->>[<]<+]>> (14b 9pts) which will stop on the non-0 cell

Answer 5

Here is my attempt. After doing it, I see that it is similar to other entries.

+[-[[-]>-<]>+]<   has 15 commands not including part that puts number in memory

             does not maintain original value
             stops at P for value 1~254
             stops at P-1 for value = 255