| Another Look At Mazes | In QHJ #12 there was an article on Cellular Automata that discussed how CA could be used to quickly and easily solve mazes. On Usenet I’ve seen some postings that deal with other ways to solve mazes (the more “classical” approaches). I thought they would be of interest. – ED Can anyone gave me suggestions | Sinclair QL |
| Editor's Forum | It’s been a few months since the last QHJ, but I’ve been busy working on a few projects and doing some traveling. In early June I traveled to Newport, Rhode Island to attend the “Miracle in Newport 93” QL show. There I was able to meet some QL’ers that I have not met before, plus | Sinclair QL |
| Internet Conciseness Contest | Mark Schnitzius (schnitzi@eustis.cs.ucf.edu) has started and runs the Internet Conciseness Contest. The contest is designed to provide an outlet for recreational programming. The contest accepts programs only in Ansi C. Scores are based on the number of tokens in a program. The lower the score the better. Mark is up to Round number 4. Below | Sinclair QL |
| More On Text Editors | Reading through Tim’s article on text editors in QHJ #13, I found that his list of editors available on the QL was far from being complete. That is why I would like to add the following to his overview. SEDIT by Ralf Redoendt of Dilwyn Jones Computing A small and fast editor written in compiled | Sinclair QL |
| Ten Commandments Of C Programmers | This was a document that I found on the Internet that I thought would be an interest to the C programmers out there – ED | Sinclair QL |
