-
Notifications
You must be signed in to change notification settings - Fork 448
Towers of hanoi #725
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
Christrevino22
wants to merge
5
commits into
AustinCodingAcademy:gh-pages
Choose a base branch
from
Christrevino22:towersOfHanoi
base: gh-pages
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+114
−7
Open
Towers of hanoi #725
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,3 @@ | ||
| "use strict" | ||
|
|
||
| console.log("Hello World!"); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,61 @@ | ||
| function movePiece(startStack, endStack) { | ||
| // Your code here, gives the move a variable | ||
| let currentPiece = stacks[startStack].pop(); | ||
| // add current piece to end stack | ||
| stacks[endStack].push(currentPiece) | ||
| } | ||
|
|
||
| function isLegal(startStack, endStack) { | ||
| // need to add something it can check | ||
| const legalMove = ["a", "b", "c"]; | ||
|
|
||
| if(legalMove.includes(startStack) == false || legalMove.includes(endStack) == false) | ||
| { | ||
| return false; | ||
| } | ||
|
|
||
| //empty stack means move is legal | ||
| if(stacks[endStack].length == 0) | ||
| { | ||
| return true; | ||
| } | ||
|
|
||
| //if piece is larger move is legal | ||
| else if(stacks[startStack].slice(-1) < stacks[endStack].slice(-1)) | ||
| { | ||
| return true; | ||
| } | ||
| else | ||
| { | ||
| return false; | ||
| } | ||
|
|
||
| } | ||
|
|
||
| function checkForWin(startStack, endStack) { | ||
| // checking to win | ||
| if( stacks.b.length === 4 || stacks.c.length === 4) | ||
| { | ||
| console.log("You've won!!!!") | ||
| return true; | ||
| } | ||
| else | ||
| { | ||
| return false; | ||
| } | ||
|
|
||
| } | ||
|
|
||
| function towersOfHanoi(startStack, endStack) { | ||
| // Your code here | ||
| if(isLegal(startStack, endStack) == true) | ||
| { | ||
| movePiece(startStack, endStack) | ||
| } | ||
| else | ||
| { | ||
| console.log("YOU SHALL NOT PASS!!") | ||
| } | ||
| checkForWin(); | ||
|
|
||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -19,24 +19,67 @@ function printStacks() { | |
| console.log("c: " + stacks.c); | ||
| } | ||
|
|
||
| function movePiece() { | ||
| // Your code here | ||
|
|
||
| function movePiece(startStack, endStack) { | ||
| // Your code here, gives the move a variable | ||
| let currentPiece = stacks[startStack].pop(); | ||
| // add current piece to end stack | ||
| stacks[endStack].push(currentPiece) | ||
| } | ||
|
|
||
| function isLegal() { | ||
| // Your code here | ||
| function isLegal(startStack, endStack) { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. i was able to move from an empty stack to a populated stack |
||
| // need to add something it can check | ||
| const legalMove = ["a", "b", "c"]; | ||
|
|
||
| if(legalMove.includes(startStack) == false || legalMove.includes(endStack) == false) | ||
| { | ||
| return false; | ||
| } | ||
|
|
||
| //empty stack means move is legal | ||
| if(stacks[endStack].length == 0) | ||
| { | ||
| return true; | ||
| } | ||
|
|
||
| //if piece is larger move is legal | ||
| else if(stacks[startStack].slice(-1) < stacks[endStack].slice(-1)) | ||
| { | ||
| return true; | ||
| } | ||
| else | ||
| { | ||
| return false; | ||
| } | ||
|
|
||
| } | ||
|
|
||
| function checkForWin() { | ||
| // Your code here | ||
| function checkForWin(startStack, endStack) { | ||
| // checking to win | ||
| if( stacks.b.length === 4 || stacks.c.length === 4) | ||
| { | ||
| console.log("You've won!!!!") | ||
| return true; | ||
| } | ||
| else | ||
| { | ||
| return false; | ||
| } | ||
|
|
||
| } | ||
|
|
||
| function towersOfHanoi(startStack, endStack) { | ||
| // Your code here | ||
|
|
||
| if(isLegal(startStack, endStack) == true) | ||
| { | ||
| movePiece(startStack, endStack) | ||
| } | ||
| else | ||
| { | ||
| console.log("YOU SHALL NOT PASS!!") | ||
| } | ||
| checkForWin(); | ||
|
|
||
| } | ||
|
|
||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. missing additional tests. |
||
| function getPrompt() { | ||
|
|
||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
note sure this counts, not much here other than code.