Foul mood day, beware!
1) there are no examples for other than 3 rows. How can you tell if a solution is correct in general?
2) Pepe proved, by tacitly implementing a Turing machine, that tacit j is Turing complete. Hence the problem can be solved tacitly if it's amenable to machine solution.
On 09/28/2016 08:00 AM, [email protected] wrote:
Date: Wed, 28 Sep 2016 00:59:06 +0000 (UTC) From: "'Jon Hough' via Programming"<[email protected]> To:<[email protected]> Subject: Re: [Jprogramming] Zig Zag problem Message-ID:<[email protected]> Content-Type: text/plain; charset=UTF-8 Yes, thanks. I didn't think this problem could be solved purely tacitly, but seems I was wrong. By the way, small nitpick, but your solution fails for the case of number of rows = 1: 1 tconvert 'SOMETEXT'
---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
