Brainf*** code golf challenge - write a Brainf*** program that searches for the first non-zero cell 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.

&gt;                           1 point  
&gt; &gt;                         1 point  
&gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; &gt; 1 point  
&lt; &lt; &lt; &lt; &lt; &lt; &lt; &lt; &lt; &lt; &lt;       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
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.
+[-[[-&lt;&lt;+&gt;&gt;]&lt;&lt;+&gt;&gt;-&lt;]&gt;+]-&lt;&lt;[-&gt;&gt;+&lt;&lt;]&gt;&gt;

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 (&quot;The program should start somewhere in fairly low memory&quot;).
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 ] &gt;

[Testing code: ]
&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt; [... any number of &gt; ...] &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;
[ASCII code '0'] ++++++[-&lt;++++++++&gt;]
&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; [... the same number of &lt; ...] &lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt;


[Find it and stop:  ]
+[-[[-&lt;&lt;+&gt;&gt;]&lt;&lt;+&gt;&gt;-&lt;]&gt;+]-&lt;&lt;[-&gt;&gt;+&lt;&lt;]&gt;&gt;



&gt;[Output, for checking: ]&lt;
.   

Example run:
~ Me$ bf f.bf
0