Windows Apps

WordFun IS FUN. WordFun FINDS ALL WORDS THAT CAN BE FORMED USING THE LETTERS IN A WORD OR STRING THAT YOU PROVIDE.

Did you ever wonder how many words could be formed from the letters in, say, your last name? Or any word that you might want to try? Or any random string of letters that you might think of?

You enter a word or string of letters. WordFun looks for all legitimate words that can be formed by using all combinations of the letters in the string. The words it looks for can have 2, 3, 4, or any number of letters up to the number of letters in the string.

You might want to see if you can figure out all the possible words yourself and then let WordFun find as many words as it can.

WordFun can be both a curiosity for adults and a game for kids. Would you have ever guessed, for example, that at least 100 words can be formed from the letters that spell “valentine”? Try guessing all the words that can be formed for any word or string of letters that you might select. Challenge your kids to guess, too!

WordFix IS FUN. WordFix UNSCRAMBLES A GROUP OF SCRAMBLED LETTERS THAT YOU PROVIDE AND FINDS ALL WORDS WITH THE SAME NUMBER OF LETTERS.

Have you been frustrated by jumble word games that you find in newspapers and on the internet? Sometimes the jumble of letters just doesn't seem to make sense.

Enter a set of scrambled letters into WordFix and let it unscramble them for you.

GetPath can help you resolve some puzzling problems on your Windows computer.

Have you ever been installing an app and gotten a warning message like “Your System Path (%PATH%) is too long” or “We have detected that your System Path is close to reaching the Windows limit”? What does this mean? How can you fix it?

GetPath provides you with the information you need to correct problems with your Windows System Path. It will read your Windows System Path and list all the Path members. It will tell you how long your Path is and let you know if it’s too long. It will tell you if any members of your Windows System Path are duplicates. Duplicates can always be deleted. Other types of Windows System Path members can be deleted, too.

GetPath's 'Help' menu makes everything clear.

Now with Auto Complete. So you can complete the game automatically if you just want to see the solution.

This new version features more keyboard shortcuts for more convenient play.

If you've begun playing the popular game of Sudoku, you will enjoy using this program. Called Sudoku Playing Palette, the program takes the unnecessary work out of playing Sudoku. It doesn't play the game for you but it reduces the need for the player to figure out what numbers may be played at each location. It eliminates the scribbling of notes inside the game. By relieving this tedious aspect of Sudoku, it allows you to concentrate on the correct logical choices. In short, it lets you simply play!

This 64-bit version will run only on 64-bit computers. You will simply get an error message if you attempt to run it on a 32-bit computer.

Searches the selected drive for the largest files on that drive. This is useful if you are running out of space on a disk or partition. If BigFiles finds redundant image or video files, for example, or other unneeded large files, you can decide if you need to keep that file or if it can be deleted to yield additional disk space. Wild cards can be used. So you can search for all files or particular file names or extensions.

The new Version 5.40 is 35% faster than previous versions.

Grepsub searches ASCII files through subfolders and looks for multiple strings.

Grepsub is an excellent tool for programmers and web developers because it can be used to find sets of commands and parameters in source code listings, something typically not possible when using standard code editors. This was the reason for Grepsub's creation.

Finds the best possible resistor pairs such that either: (1) their ratio is as close as possible to a desired ratio; or, (2) an unloaded voltage divider delivers a voltage as close as possible to a desired voltage.

This may seem trivial, especially for the old engineers who used to use a slide rule for this task. But your method might not find the best pair. (Naturally, any resistors you use will have inherent errors. However, by using the best pair, you can avoid an avoidable "designed-in" error.)

Resistors makes choosing the best pair simple. You can select among resistor sets having tolerances of 0.1%, 0.25%, 0.5%, 1%, 2%, and 5%.

You might be interested to know that the original version of this program was published in the now-defunct Kilobaud Microcomputing, April 1980, pp. 142‑144. Though its modern version is written in C++ for 32-bit Windows, it was originally written in Basic for use on a Commodore PET.

This tool can be used to determine if a selected set of feedback taps implements a linear, maximal, pseudorandom shift register configuration for a shift register of a given length. Thus, it can be used to determine if a proposed hardware design will be maximal. Up to 36 stages can be represented.

This 64-bit version will run only on 64-bit computers. You will simply get an error message if you attempt to run it on a 32-bit computer.