gitea-mirror/basic-computer-games
1
0
Fork 0
mirror of https://github.com/coding-horror/basic-computer-games.git synced 2025-12-13 00:00:25 -08:00
Code Issues Packages Projects Releases Wiki Activity

implement 96_Word as node.js script

Browse Source
This commit is contained in:
Alexander Wunschik
2022-04-02 14:40:15 +02:00
parent dc8bb273cd
commit 50fedb26ec
3 changed files with 115 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
96_Word/javascript/word.html
View File

@@ -1,10 +0,0 @@
<html>
<head>
<title>WORD</title>
<link rel="stylesheet" href="../../00_Utilities/javascript/style_terminal.css" />
</head>
<body>
<pre id="output"></pre>
<script src="word.js"></script>
</body>
</html>

114
96_Word/javascript/word.mjs Normal file
View File

@@ -0,0 +1,114 @@
#!/usr/bin/env node
// WORD
//
// Converted from BASIC to Javascript by Oscar Toledo G. (nanochess)
import { print, tab, input } from '../../00_Common/javascript/common.mjs';
// These are the words that the game knows about> If you want a bigger challenge you could add more words to the array
const WORDS = ["DINKY", "SMOKE", "WATER", "GLASS", "TRAIN",
"MIGHT", "FIRST", "CANDY", "CHAMP", "WOULD",
"CLUMP", "DOPEY"];
const WORD_COUNT = WORDS.length;
// Main control section
async function main()
{
print(tab(33) + "WORD\n");
print(tab(15) + "CREATIVE COMPUTING MORRISTOWN, NEW JERSEY\n");
print("\n");
print("\n");
print("\n");
print("I AM THINKING OF A WORD -- YOU GUESS IT. I WILL GIVE YOU\n");
print("CLUES TO HELP YOU GET IT. GOOD LUCK!!\n");
print("\n");
print("\n");
outer: while (1) {
print("\n");
print("\n");
print("YOU ARE STARTING A NEW GAME...\n");
const secretWord = WORDS[Math.floor(Math.random() * WORD_COUNT)];
let guessCount = 0;
// This array holds the letters which have been found in the correct position across all guesses
// For instance if the word is "PLAIN" and the guesses so far are
// "SHALL" ("A" correct) and "CLIMB" ("L" correct) then it will hold "-LA--"
const knownLetters = [];
for (let i = 0; i < 5; i++)
knownLetters[i] = "-";
let guess = undefined;
while (1) {
print("GUESS A FIVE LETTER WORD:");
guess = (await input()).toUpperCase();
guessCount++;
if (secretWord === guess) {
// The player has guessed correctly
break;
}
if (guess.charAt(0) === "?") {
// Player has given up
print("THE SECRET WORD IS " + secretWord + "\n");
print("\n");
// Start a new game by going to the start of the outer while loop
continue outer;
}
if (guess.length !== 5) {
print("YOU MUST GUESS A 5 LETTER WORD. START AGAIN.\n");
print("\n");
guessCount--;
continue;
}
// Two things happen in this double loop:
// 1. Letters which are in both the guessed and secret words are put in the lettersInCommon array
// 2. Letters which are in the correct position in the guessed word are added to the knownLetters array
let lettersInCommonCount = 0;
const lettersInCommon = [];
for (let i = 0; i < 5; i++) {// loop round characters in secret word
let secretWordCharacter = secretWord.charAt(i);
for (let j = 0; j < 5; j++) {// loop round characters in guessed word
let guessedWordCharacter = guess.charAt(j);
if (secretWordCharacter === guessedWordCharacter) {
lettersInCommon[lettersInCommonCount] = guessedWordCharacter;
if (i === j) {
// Letter is in the exact position so add to the known letters array
knownLetters[j] = guessedWordCharacter;
}
lettersInCommonCount++;
}
}
}
const lettersInCommonText = lettersInCommon.join("");
print("THERE WERE " + lettersInCommonCount + " MATCHES AND THE COMMON LETTERS WERE... " + lettersInCommonText + "\n");
const knownLettersText = knownLetters.join("");
print("FROM THE EXACT LETTER MATCHES, YOU KNOW............ " + knownLettersText + "\n");
if (knownLettersText === secretWord) {
guess = knownLettersText;
break;
}
if (lettersInCommonCount <= 1) {
print("\n");
print("IF YOU GIVE UP, TYPE '?' FOR YOUR NEXT GUESS.\n");
print("\n");
}
}
print("YOU HAVE GUESSED THE WORD. IT TOOK " + guessCount + " GUESSES!\n");
print("\n");
print("WANT TO PLAY AGAIN");
const playAgainResponse = (await input()).toUpperCase();
if (playAgainResponse !== "YES")
break;
}
}
main();

2
index.html
View File

File diff suppressed because one or more lines are too long