Home | Introduction | Newsletters | Programs | Feedback
|
Home | Introduction | Newsletters | Programs | Feedback
|
|
What's NewAugust 19, 2017: It's been a good news-bad news month. The transfer of DFF from host EasyCgi to Alentus went fairly smoothly with FrontPage support restoredJ, but I'm being swamped by spam emails (~ 50 per day) since Alentus apparently does no screening at the server levelL. Outlook junk screening here at home is by sender address or domain name of which there seems to be an infinite number. I may be forced to another mail server if it cannot be fixed. Also thumbs down to EasyCgi for dropping FrontPage support without prior notice and for refusing to credit me for the unused 6 months of prepaid hosting feesL.
August 1, 2017: If you're reading this, I'm happy to report that the DFF site has been successfully transferred to the new host. Feedback and Newsletter Subscription emails are working again and FrontPage can again be used to maintain and publish site changes. Time will tell if if there are drawbacks as yet undiscovered. If you encounter problems, please use the feedback to let me know., July 25, 2017: Starting the site relocation tomorrow. In theory, nothing will change from the visitors viewpoint until I verify that all is working on the new site. One more program update posted today was to fix a scaling bug in our program which solves problems like this one from my Mensa calendar entry for July 23:.
The challenge is to find a word for the middle row which forms a three letter word in each of the seven columns. Program WordGrid_3Letters, Version 2.1 does that in short order.
April 21, 2017: Here's a Delphi demo, HeapsPermute, of an algorithm developed by J.R. Heap in 1963 which generates permutations of arbitrary data items. It is quite efficient because it swaps only 2 elements for each permutation generated. The disadvantage may be that that there is no apparent order in the generated permutations. Search "Heap's algorithm" on Wikipedia for more information. I plan to use the algorithm in a future "Made from scratch" puzzle solver which doesn't use the existing DFF Library. March 28, 2017: We're back!. If you received a "Service Unavailable" message in the past two days, no worries. The host site maintenance guys mess up and cause this about once a month. It's usually only a couple of hours, but this time it was 2 daysL. I'm guessing that the root cause is that the DFF site runs under FrontPage, a terrific website builder abandoned by Microsoft years ago with no suitable conversion aids or equivalent replacement available. Manual conversion to something less usable is an easy task to defer, so I'm limping along with the old, unsupported builder program and not many choices for finding another host. After careful cost/benefit analysis, my conclusion is that what happens in the future is a problem to be addressed in the future. In the meantime, I discovered a small bug in an old beginner's level program which generates odd order "magic squares" up to 51x51 using an ancient algorithm. Magic Squares V1.1 corrects a grid sizing problem for the 3x3 square. March 19, 2017: CutList Version 4.05 posted today corrects a few misspelling and truncated text errors caught by a couple of sharp eyed users. Thanks to Karson and Anthony for taking the time to let ne know.
March 6, 2017: Several years ago, a buddy of mine took on the design and implementation of a children's water fountain with multiple nozzles squirting at random intervals and durations. I created an animated simulation to illustrate what it might look like. The result was posted here in the "Delphi Techniques" section as an example of how to draw on a graphic control. (a "TNozzle" in thus case). You can view a picture of the resulting real "Splash Pad" here. A Delphi programmer recently sent me
his attempt to move the TNozzle class to a separate unit and found
that the his drawing attempts were displayed in the wrong place. The
solution was to draw on the canvas of the TNozzle Parent
property.
ShapePaint Version 2.0 demonstrates how to do this. The What's New Archives2017 2016 2015 2014
|
[Feedback] [Newsletters (subscribe/view)] [About me]Copyright © 2000-2017, Gary Darby All rights reserved.
|
On
the fun side of he street though, I did manage to crack a fairly complicated
word search puzzle solverJ. The puzzle solution requires forming five
5-letter words by selecting one letter from each row corresponding to the letter
position in the word being formed. All letters will be used exactly once.
So the 1st letters of the words will be A, B, G, T, and W. 2nd letters will be
chosen from U, A, R, L ,P with each letter appearing in one word, etc.
Brute Force is my "go-to" puzzle solver for an amazing number of puzzle
types (50 sample puzzles included in the downloads). It solves by
exhaustive search ("trial and error") if they can be described with a
set of integer equations with a limited range of solution values.
I recently checked to see if it could solve the
