Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
C
comp30024-project-1
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Scott Wong
comp30024-project-1
Repository graph
Repository graph
You can move around the graph by using the arrow keys.
8bc241f97c3c87d372fe936574a31be19a57f17c
Select Git revision
Selected
8bc241f97c3c87d372fe936574a31be19a57f17c
Branches
1
master
default
protected
2 results
Begin with the selected commit
Created with Raphaël 2.2.0
31
Mar
30
28
27
26
25
22
21
20
17
removing debug code
master
master
Removed test.py
Removed input(). It goes really fast!
Debug for printing
fix bug
fixing the comment
I did not decide when to terminate if there are no possible path to the target{since the piece dont know if it can get to its target or not, it just move}
Add more type hinting, change some of the parameter name to keep all the terms the same
attempt to clean up the code , add type hinting + make use of global variable. XUAN TRINH 1:30PM 28 mar 2021
When process over the priority list of all possible moves of every piece, prioritise the one with the least option, XUAN 11:30PM 27 Mar 2021
add more rule to rate an action{take travelled path into consideration} <- to avoid infiniteloop XUAN 10:00PM 27 mar 2021
Can run!! [D[D[D under most scenario! Will work on what if there no way a piece can get to its target. XUAN 5:30PM [D[D[D[D[D[8[B[C[C[C[C[C 27 Mar 2021
Let piece -which is made it to its target, choose another target if any. XUAN 5:36PM 27 March 2021
debug: where piece slide/swing on stronger piece, XUAN
Allow piece to take swing action when deciding which path to take, Add test case 0 to test swing action.XUAN TRINH 4:00PM 27 mar 2021
[D
Added test situations
First, i change the name bfore i realised that all normal case naming are convention{}[Dmy fauft for this[C}, secondly adding constant to eliminate magic number, thrid found a bug.[D[D[D[D[D[D[D[D[D[D[D[D[Dird[C[C[C[C[C[C[C[C[C[C[C[C[C
Added target selection function
added comment about starting on algorithm
modulise the function that read piece into dictionary and block to set. Also delete the dedundance function -XUAN TRINH 7PM 22 mar 2021
Finalised import, global dict and list
Add the move selection logic to add to Queue for expanding using either DFS or BDF. i need to stop to wait for we come to argee on how we want to store the block, the move. Before i can continue check for move collision and avoiding block
Found a conflict in opinion, add my opinion into the comment section.
Merge branch 'master' of https://gitlab.eng.unimelb.edu.au/scottmw/comp30024-project-1 into master
In movement logic: add the constraint to ensure new move need to be in the board. handling details are added to the method comment - XUAN TRINH2021 3 21
Can add non-dupe pieces to dict
attempt clean up my code, add arguement and return to comment section
add comment about the format of the position dict
temporary version of getting the position list {i will clean up the code }
Literally only typo corrections
add the action logic {for both swing and slide}, function to compare 2 tile
6pm 20-03, added comparison of two pieces and sample dictionary
Add the test case. function to calculate distance, some basic movement logic + read file into dict
Initial commit, only skeleton code present
Loading