Compare commits

...

99 Commits

Author SHA1 Message Date
vargadavidlajos
b91777a64f Merge branch 'master' into Engine/move-gen 2025-11-20 21:19:41 +01:00
Varga Dávid Lajos
775083fde7 fixed wrong promotion_piece indexes being saved in bitboard::movegen::pawns 2025-11-20 21:11:41 +01:00
Varga Dávid Lajos
84121fbeba allowed use of move generation methods in case of check 2025-11-20 20:45:26 +01:00
Varga Dávid Lajos
f3d316d3e3 implemented method collect_king_evasion in bitboard::movegen used in move generation 2025-11-20 20:43:35 +01:00
Varga Dávid Lajos
fad1a6d51b implemented method collect_moves_single_check in bitboard::movegen used in move generation 2025-11-20 20:42:44 +01:00
Varga Dávid Lajos
9b43c9ce9a implemented method collect_all_moves in bitboard::movegen used in move generation 2025-11-20 20:39:47 +01:00
Varga Dávid Lajos
dba7aca2cf added method get_safe_king_squares to bitboard::attacks for king safety checks 2025-11-20 20:35:44 +01:00
Varga Dávid Lajos
47a22dbbaa added method get_pseudo_rook_moves_ignore_king in bitboard::attacks for king safety checks 2025-11-20 20:29:27 +01:00
Varga Dávid Lajos
1bbe33f3aa added method get_pseudo_bishop_moves_ignore_king in bitboard::attacks for king safety checks 2025-11-20 20:28:16 +01:00
Varga Dávid Lajos
8c0fa09f1e added LUT KING_SAFETY_BISHOP_MASK in bitboard::attackmaps for king safety checks 2025-11-20 20:25:14 +01:00
Varga Dávid Lajos
d8eae9177b added LUT KING_SAFETY_ROOK_MASK in bitboard::attackmaps for king safety checks 2025-11-20 20:23:40 +01:00
Varga Dávid Lajos
71ea2a05d0 added LUT BISHOP_MOVE_MASK in bitboard::attackmaps for king safety checks 2025-11-20 20:22:08 +01:00
Varga Dávid Lajos
33ca535547 added LUT ROOK_MOVE_MASK in bitboard::attackmaps for king safety checks 2025-11-20 20:21:28 +01:00
Varga Dávid Lajos
08ba7ee436 implemented move generation method for castling moves 2025-11-20 12:41:20 +01:00
Varga Dávid Lajos
5b3e84dab0 implemented move generation method or king capture moves 2025-11-20 12:35:46 +01:00
Varga Dávid Lajos
21d26902f0 implemented general move generation methdod for kings 2025-11-20 12:33:58 +01:00
Varga Dávid Lajos
e9f7663488 added file and module structure for bitboard::movegen::kings 2025-11-20 12:28:46 +01:00
Varga Dávid Lajos
c2abc08206 implemented move generation method for queen capture moves 2025-11-20 12:27:31 +01:00
Varga Dávid Lajos
9fa298ed51 implemented general move generation method for queens 2025-11-20 12:26:16 +01:00
Varga Dávid Lajos
a51d5e2652 added file and module structure for bitboard::movegen::queens 2025-11-20 12:24:40 +01:00
Varga Dávid Lajos
0dd9a3d047 implemented move generation method for rook capture moves 2025-11-20 12:23:14 +01:00
Varga Dávid Lajos
e896aba4ec implemented general move generation method for rooks 2025-11-20 12:18:25 +01:00
Varga Dávid Lajos
9fb3d15bed added file and module structure for bitboard::movegen::rooks 2025-11-20 12:14:31 +01:00
Varga Dávid Lajos
35cb1eeb73 implemented move generation method for bishop capture moves 2025-11-19 21:13:05 +01:00
Varga Dávid Lajos
8165749845 implemented general move generation method for bishops 2025-11-19 21:11:39 +01:00
Varga Dávid Lajos
06cb2b88c2 added file and module structure for bitboard::movegen::bishops 2025-11-19 21:08:45 +01:00
Varga Dávid Lajos
2d646f0ad0 implemented move generation method for knight capture moves 2025-11-19 21:07:18 +01:00
Varga Dávid Lajos
40e2c50209 implemeneted general move generation method for knight moves 2025-11-19 21:05:58 +01:00
Varga Dávid Lajos
2e82a52f27 added file and module structure for bitboard::movegen::knights 2025-11-19 21:03:27 +01:00
Varga Dávid Lajos
372d86b451 changed signature utility functions utils::pop_lsb and utils::pop_msb to reduce unnecessary type conversions 2025-11-19 20:58:56 +01:00
Varga Dávid Lajos
d66787f51d implemented method to collect both quiet and capture moves for pawns 2025-11-19 20:54:01 +01:00
Varga Dávid Lajos
a4c63f19e5 implemented move generation method for pawn capture moves 2025-11-19 20:52:28 +01:00
Varga Dávid Lajos
a2f261778b implemented move generation method for pawn quiet moves 2025-11-19 20:47:44 +01:00
Varga Dávid Lajos
3f7cc2df4d added file and module structure for bitboard::movegen::pawns 2025-11-19 20:39:00 +01:00
Varga Dávid Lajos
48272d6d70 added skeleton for main move generation method to bitboard::movegen 2025-11-19 20:35:46 +01:00
Varga Dávid Lajos
d172afc50c re-added missing code for check tests from past branch 2025-11-19 20:32:12 +01:00
Varga Dávid Lajos
ee61528891 added file and module structure for bitboard::movegen.rs 2025-11-19 20:16:48 +01:00
Hatvani Tamás
0ace485bb6 Merge pull request #19 from htamas1210/Engine/movebuffer
Engine/movebuffer
2025-11-19 20:14:45 +01:00
Hatvani Tamás
1c1b9a96d9 Import time module and add sleep in data upload
Added time.sleep to control row insertion rate.
2025-11-19 17:34:44 +01:00
Hatvani Tamás
e99b2defa3 Merge pull request #18 from htamas1210/Engine/bitmove
Engine/bitmove
2025-11-19 17:10:03 +01:00
Varga Dávid Lajos
f39c113ef9 implemented method append for struct MoveBuffer 2025-11-19 16:13:34 +01:00
Varga Dávid Lajos
f417a7e47c implemented getter for field buffer i struct MoveBuffer 2025-11-19 16:09:31 +01:00
Varga Dávid Lajos
547b0e51cb corrected annotation for method clear in struct MoveBuffer 2025-11-19 16:00:09 +01:00
Varga Dávid Lajos
5340744abe implemented method clear for struct MoveBuffer 2025-11-19 15:56:57 +01:00
Varga Dávid Lajos
f64ebfa47f implemented method get for struct MoveBuffer 2025-11-19 15:53:39 +01:00
Varga Dávid Lajos
4e7ac2a195 added getter for field count in struct MoveBuffer 2025-11-19 15:50:03 +01:00
Varga Dávid Lajos
dc176c103b implemented method add for struct MoveBuffer 2025-11-19 15:40:11 +01:00
Varga Dávid Lajos
85a7fa37ef added parameterless constructor for struct MoveBuffer 2025-11-19 15:22:15 +01:00
Varga Dávid Lajos
a60658763d defined shape of struct MoveBuffer 2025-11-19 15:06:37 +01:00
Varga Dávid Lajos
b76a009e4e added file and module structure for movebuffer.rs 2025-11-19 14:57:36 +01:00
Varga Dávid Lajos
db333a693f added method uci_notation to struct BitMove 2025-11-18 17:38:48 +01:00
Varga Dávid Lajos
fd0d26486b switched from public fields to getters for struct BitMove 2025-11-18 17:30:04 +01:00
Varga Dávid Lajos
e1f4ae717e added constructor for castling moves in bitboard::bitmove.rs 2025-11-18 17:24:11 +01:00
Varga Dávid Lajos
7b9c1edbab added constructor for capture moves in bitboard::bitmove.rs 2025-11-18 17:23:07 +01:00
Varga Dávid Lajos
05294a7736 changed name of value of enum BitMoveType to align with Rust naming conventions 2025-11-18 17:20:40 +01:00
Varga Dávid Lajos
d8da808580 added enum BitMoveType to bitboard::bitmove.rs for readability 2025-11-18 17:19:31 +01:00
Varga Dávid Lajos
c420d8b3dd added constructor for quiet moves in bitboard::bitmove.rs 2025-11-18 17:17:11 +01:00
Varga Dávid Lajos
57af3aaae3 defined shape of struct bitboard::bitmove::BitMove 2025-11-18 17:09:39 +01:00
Varga Dávid Lajos
887b9abed8 adde file and module structure for bitboard::bitmove.rs 2025-11-18 17:02:07 +01:00
vargadavidlajos
a862d31c7d Merge pull request #17 from htamas1210/Server/event
Server/event
2025-11-18 16:58:29 +01:00
48f66aac75 added engine as a crate into server project, implemented request moves event 2025-11-18 16:43:14 +01:00
Hatvani Tamás
431c65e075 Merge pull request #16 from htamas1210/Engine/check-test
Engine/check test
2025-11-18 16:41:49 +01:00
Varga Dávid Lajos
7e64a7ca16 fixed incorrect test parameter in bitboard::legality::tests::check_test_test 2025-11-18 16:20:42 +01:00
Varga Dávid Lajos
6e0efc76f3 added missing method place_piece to struct bitboard::Board 2025-11-18 16:18:19 +01:00
Varga Dávid Lajos
1a9d7ad460 added tests for method bitboard::legality::check_test 2025-11-18 16:15:28 +01:00
6dfe92f211 Merge branch 'master' into Server/event 2025-11-18 16:12:07 +01:00
Varga Dávid Lajos
9209f1c4e0 implemented method check_test in bitboard::checktest.rs 2025-11-18 12:14:22 +01:00
4bb485e833 added findmatch event 2025-11-18 09:28:07 +01:00
Bence
3ebfc61ac7 Merge pull request #15 from htamas1210/Engine/library-functions
Engine/library functions
2025-11-17 15:04:28 +01:00
Hatvani Tamás
d8d8b58ed7 Uploaded presentation for class 2025-11-17 12:24:42 +01:00
Varga Dávid Lajos
a8970053f9 added constructor for castling moves in chessmove.rs 2025-11-16 19:05:52 +01:00
vargadavidlajos
7cd77ab904 Merge pull request #14 from htamas1210/Docs/kovspec
Added point 3 to kovspec.md
2025-11-16 19:05:07 +01:00
Varga Dávid Lajos
fa0a93172d added constructore for captures in chessmove.rs 2025-11-16 19:01:53 +01:00
Varga Dávid Lajos
bb74a486d8 added constructor for quiet moves in chessmove.rs 2025-11-16 19:00:00 +01:00
vargadavidlajos
10c176a0f5 Added point 3 to kovspec.md 2025-11-16 18:39:48 +01:00
Varga Dávid Lajos
d1932762f9 removed field is_promotion from struct ChessMove and added an Option for field promotion_piece 2025-11-16 18:33:04 +01:00
Varga Dávid Lajos
9181b6c4ca added all arguments constructor for struct BoardSquare 2025-11-16 13:51:10 +01:00
Varga Dávid Lajos
b703d8b9a1 added parameterless constructor for struct BoardSquare 2025-11-16 13:44:41 +01:00
Varga Dávid Lajos
acaa7d078a added new library function: get_board_after_move 2025-11-15 20:40:58 +01:00
Varga Dávid Lajos
30448b5f3d switched return type of is_game_over from bool to GameEnd 2025-11-15 20:37:06 +01:00
Varga Dávid Lajos
ff38c5c475 added struct GameEnd 2025-11-15 20:28:33 +01:00
Varga Dávid Lajos
42daeb9971 added file and module structure for gameend.rs 2025-11-15 20:15:17 +01:00
Bence
fc7ece9e94 Fixed app not starting in fullscreen 2025-11-15 20:09:26 +01:00
Varga Dávid Lajos
c8b6bc35d5 added library functions: get_available_moves and is_game_over 2025-11-15 20:08:54 +01:00
Varga Dávid Lajos
5f2a4e1721 added struct ChessMove 2025-11-15 19:57:11 +01:00
c77e534ed8 removed event system file as it was unused and we do not neet it anymore 2025-11-15 19:41:48 +01:00
Varga Dávid Lajos
5c42b6e52a added enum MoveType 2025-11-15 19:37:30 +01:00
Varga Dávid Lajos
f7364e7939 added file and module structure for movetype.rs 2025-11-15 19:35:17 +01:00
1c92918692 finished join event 2025-11-15 19:33:40 +01:00
Varga Dávid Lajos
b4a1f0820f added struct BoardSquare 2025-11-15 19:26:21 +01:00
Varga Dávid Lajos
6d9d5c49ae added file and module structure for boardsquare.rs 2025-11-15 19:24:37 +01:00
Varga Dávid Lajos
1ca44b472b added enum PieceType 2025-11-15 19:21:46 +01:00
Varga Dávid Lajos
79aabeac8c added file and module structure for piecetype.rs 2025-11-15 19:17:50 +01:00
Varga Dávid Lajos
5eb85dab89 added file and module structure for file: chessmove.rs 2025-11-15 19:15:30 +01:00
Varga Dávid Lajos
291b7e71a2 added crate root file lib.rs for library crate 2025-11-15 19:14:08 +01:00
vargadavidlajos
2aaa2aca70 Merge pull request #13 from htamas1210/UI/SettingsAndGame
Created a new branch due to a bug
2025-11-15 19:11:39 +01:00
cca852d466 Working on event system, join implemented 2025-11-15 18:32:43 +01:00
a098c8051a planning done on how the event system works 2025-11-15 16:41:11 +01:00
e599722e45 added client for testing connection and events 2025-11-15 14:44:44 +01:00
32 changed files with 1365 additions and 184 deletions

View File

@@ -20,7 +20,7 @@ jobs:
echo "$GOOGLE_SERVICE_ACCOUNT_JSON" > service_account.json echo "$GOOGLE_SERVICE_ACCOUNT_JSON" > service_account.json
python <<'PYCODE' python <<'PYCODE'
import gspread, json, subprocess import gspread, json, subprocess, time
creds = json.load(open("service_account.json")) creds = json.load(open("service_account.json"))
gc = gspread.service_account_from_dict(creds) gc = gspread.service_account_from_dict(creds)
@@ -38,6 +38,7 @@ jobs:
for i, row in enumerate(rows_to_append): for i, row in enumerate(rows_to_append):
worksheet.insert_row(row, start_row + i) worksheet.insert_row(row, start_row + i)
time.sleep(1)
with open(f"{v}/test_data.log", "r") as f: with open(f"{v}/test_data.log", "r") as f:

View File

@@ -22,6 +22,68 @@ A vágyálom rendszer alapját egy központi szerver képezné, amely kezeli a f
A platform célja a megbízható és folyamatos működés, akár nagyobb terhelés mellett is. A rendszer fejlesztése során kiemelt szempont lenne a biztonság (adatvédelem, csalás elleni védelem), a stabil hálózati kommunikáció, valamint a bővíthetőség például ranglisták, versenyek vagy mobilalkalmazás későbbi integrálásának lehetősége. A platform célja a megbízható és folyamatos működés, akár nagyobb terhelés mellett is. A rendszer fejlesztése során kiemelt szempont lenne a biztonság (adatvédelem, csalás elleni védelem), a stabil hálózati kommunikáció, valamint a bővíthetőség például ranglisták, versenyek vagy mobilalkalmazás későbbi integrálásának lehetősége.
Összességében a vágyálom rendszer egy minden szempontból teljes értékű, közösségorientált sakkalkalmazás lenne, amely a mostani, helyi hálózaton működő változatból fejlődne tovább egy interneten keresztül bárhonnan elérhető platformmá. Összességében a vágyálom rendszer egy minden szempontból teljes értékű, közösségorientált sakkalkalmazás lenne, amely a mostani, helyi hálózaton működő változatból fejlődne tovább egy interneten keresztül bárhonnan elérhető platformmá.
## 3. Igényelt funkciók
### Alapok
- Két játékos közti sakkjátszma lebonyolítása.
- Teljes szabályrendszer megvalósítása (érvényes lépések, sakk/sakkmatt/patt felismerése).
- Új játék indítása.
- Játékosok nevének megadása a játszma elején.
- Felhasználóbarát grafikus felület (UI) látható tábla, figurák, órák, státuszjelzések.
- Játékoslépések vizuális kiemelése (pl. kijelölt mező, lehetséges lépések megjelenítése).
- A játék állapotának kijelzése (folyamatban, sakk, matt, döntetlen).
### LAN és hálózati funkciók
- „Szerver indítása” funkció a játékos hostként indíthat egy helyi szervert.
- „Csatlakozás” funkció másik játékos IP-cím alapján tud csatlakozni.
- Helyi hálózaton keresztüli valós idejű kommunikáció.
- LAN játék automatikus felfedezése (broadcast keresés).
- Játék mentése és visszatöltése hálózati módban.
### Online vágyálom funkciók
- Felhasználói regisztráció és bejelentkezés.
- Jelszóval védett fiókok, email- vagy OAuth-alapú hitelesítés (Google, GitHub stb.).
- Profiloldal megtekintése (név, avatar, statisztikák, értékszám).
- Automatikus matchmaking rendszer.
- Kézi játékindítás meghívó küldése barátnak.
- Játszmák mentése és visszajátszása.
- Játszmaelemzés lépések listázása, hibák kiemelése.
- Webes felület vagy mobilalkalmazás támogatása.
- Játék előzményeinek és statisztikáinak megtekintése (győzelmek, vereségek, döntetlenek).
- Automatikus szervermentés és adatbázis szinkronizáció.
### Felhasználói felület
- Letisztult, reszponzív, platformfüggetlen felület (asztali és webes verzió).
- Sötét/világos téma lehetősége.
- Egyéni figurakészlet vagy tábla kinézet választása.
- Animált figuramozgások.
- Egérrel és billentyűzettel is vezérelhető játék.
- Hangjelzések a lépésekhez és az idő lejártához.
- Lépéselőzmények (move list) megjelenítése oldalt.
- Tábla forgatásának lehetősége (pl. a fehér vagy fekete nézőpontból).
- Állapotjelzők (sakk, matt, döntetlen, várakozás az ellenfélre).
- Teljes képernyős mód.
### Technikai / fejlesztői funkciók
- Kliensszerver architektúra.
- REST API vagy WebSocket alapú kommunikáció.
- Adatbázis a felhasználói adatok és meccsek tárolására (pl. SQLite, PostgreSQL, MongoDB).
- Logolási és hibakezelési rendszer.
- Automatikus mentés és adatvisszaállítás.
- Verziókezelés (Git).
- Tesztelhető, moduláris kódszerkezet (külön modulok: logika, UI, hálózat, adat).
- Cross-platform működés (Windows, Linux, esetleg web).
### További funkciók
- Egyszemélyes mód (ember vs. gép, AI-bot).
- Több nehézségi szintű AI.
- Oktató mód (javasolt lépések, hibák magyarázata).
- Hivatalos FEN/PGN formátum export/import.
- Beépített sakkfeladványok, kihívások.
- Érintéses vezérlés mobilon.
- Többnyelvű felület (pl. magyar, angol).
## 4. Rendszer követelmények ## 4. Rendszer követelmények
A rendszer célja egy kétjátékos sakkalkalmazás megvalósítása, amely alapvetően hálózati kapcsolat (LAN vagy internet) segítségével biztosítja a valós idejű játékot. A rendszer kliensszerver architektúrán alapul, ahol az egyes komponensek jól elkülönülten, meghatározott feladatokat látnak el. A rendszer célja egy kétjátékos sakkalkalmazás megvalósítása, amely alapvetően hálózati kapcsolat (LAN vagy internet) segítségével biztosítja a valós idejű játékot. A rendszer kliensszerver architektúrán alapul, ahol az egyes komponensek jól elkülönülten, meghatározott feladatokat látnak el.

BIN
Knightly prezentáció.pptx Normal file

Binary file not shown.

View File

@@ -4,4 +4,6 @@ version = "0.1.0"
edition = "2024" edition = "2024"
[dependencies] [dependencies]
once_cell = "1.19" once_cell = "1.19"
serde = { version = "1", features = ["derive"] }
serde_json = "1"

View File

@@ -3,5 +3,8 @@ mod utils;
mod legality; mod legality;
mod checkinfo; mod checkinfo;
mod attacks; mod attacks;
mod bitmove;
mod movebuffer;
mod movegen;
pub mod board; pub mod board;

View File

@@ -94,6 +94,64 @@ pub static RAY_TABLE: Lazy<[[u64; 8]; 64]> = Lazy::new(|| {
return table; return table;
}); });
// ROOK_MOVE_MASK[<square_index>]
pub static ROOK_MOVE_MASK: Lazy<[u64; 64]> = Lazy::new(|| {
let mut table = [0u64; 64];
for sq in 0..64 {
for dir in [0, 2, 4, 6] {
table[sq] |= RAY_TABLE[sq][dir];
}
}
table
});
// BISHOP_MOVE_MASK[<square_index>]
pub static BISHOP_MOVE_MASK: Lazy<[u64; 64]> = Lazy::new(|| {
let mut table = [0u64; 64];
for sq in 0..64 {
for dir in [1, 3, 5, 7] {
table[sq] |= RAY_TABLE[sq][dir];
}
}
table
});
// KING_SAFETY_ROOK_MASK[<square_index>]
pub static KING_SAFETY_ROOK_MASK: Lazy<[u64; 64]> = Lazy::new(|| {
let mut table = [0u64; 64];
for sq in 0..64 {
let mut mask = KING_ATTACK_MAP[sq];
while mask != 0 {
let next_sq = mask.trailing_zeros();
table[sq] |= ROOK_MOVE_MASK[next_sq as usize];
mask &= !(1 << next_sq);
}
}
table
});
// KING_SAFETY_BISHOP_MASK[<square_index>]
pub static KING_SAFETY_BISHOP_MASK: Lazy<[u64; 64]> = Lazy::new(|| {
let mut table = [0u64; 64];
for sq in 0..64 {
let mut mask = KING_ATTACK_MAP[sq];
while mask != 0 {
let next_sq = mask.trailing_zeros();
table[sq] |= BISHOP_MOVE_MASK[next_sq as usize];
mask &= !(1 << next_sq);
}
}
table
});
// <----- TESTS -----> // <----- TESTS ----->

View File

@@ -5,6 +5,8 @@ impl Board {
const RANK_2: u64 = 0x0000_0000_0000_FF00; const RANK_2: u64 = 0x0000_0000_0000_FF00;
const RANK_7: u64 = 0x00FF_0000_0000_0000; const RANK_7: u64 = 0x00FF_0000_0000_0000;
const A_FILE: u64 = 0x0101_0101_0101_0101;
const H_FILE: u64 = 0x8080_8080_8080_8080;
pub fn get_pseudo_pawn_moves(&self, sq: u32) -> u64 { pub fn get_pseudo_pawn_moves(&self, sq: u32) -> u64 {
let pawn: u64 = 1 << sq; let pawn: u64 = 1 << sq;
@@ -71,6 +73,111 @@ impl Board {
pub fn get_pseudo_queen_moves(&self, sq: u32) -> u64 { pub fn get_pseudo_queen_moves(&self, sq: u32) -> u64 {
return self.get_pseudo_bishop_moves(sq) | self.get_pseudo_rook_moves(sq); return self.get_pseudo_bishop_moves(sq) | self.get_pseudo_rook_moves(sq);
} }
#[inline]
pub fn get_pseudo_bishop_moves_ignore_king(&self, sq: u32) -> u64 {
let mut moves = 0u64;
let sq = sq as usize;
let king = self.bitboards[5 + 6*self.side_to_move as usize];
let occupancy = self.occupancy[2] & !king;
moves |= get_raycast_from_square_in_direction(occupancy, sq, 1);
moves |= get_raycast_from_square_in_direction(occupancy, sq, 3);
moves |= get_raycast_from_square_in_direction(occupancy, sq, 5);
moves |= get_raycast_from_square_in_direction(occupancy, sq, 7);
return moves;
}
#[inline]
pub fn get_pseudo_rook_moves_ignore_king(&self, sq: u32) -> u64 {
let mut moves: u64 = 0u64;
let sq = sq as usize;
let king = self.bitboards[5 + 6*self.side_to_move as usize];
let occupancy = self.occupancy[2] & !king;
moves |= get_raycast_from_square_in_direction(occupancy, sq, 0);
moves |= get_raycast_from_square_in_direction(occupancy, sq, 2);
moves |= get_raycast_from_square_in_direction(occupancy, sq, 4);
moves |= get_raycast_from_square_in_direction(occupancy, sq, 6);
return moves;
}
#[inline]
pub fn is_square_attacked(&self, king_sq: u32) -> bool {
let offset: usize = 6 * self.side_to_move as usize;
// rook-queen checks (+)
let mut threat_mask: u64 = self.get_pseudo_rook_moves(king_sq);
let mut attacker_mask: u64 = self.bitboards[10 - offset] | self.bitboards[9 - offset];
if threat_mask & attacker_mask != 0 { return true; }
// bishop-queen checks (x)
threat_mask = self.get_pseudo_bishop_moves(king_sq);
attacker_mask = self.bitboards[10 - offset] | self.bitboards[8 - offset];
if threat_mask & attacker_mask != 0 { return true; }
// knight checks (L)
threat_mask = KNIGHT_ATTACK_MAP[king_sq as usize];
attacker_mask = self.bitboards[7 - offset];
if threat_mask & attacker_mask != 0 { return true; }
// pawn checks (v)
threat_mask = PAWN_ATTACK_MAP[king_sq as usize][self.side_to_move as usize];
attacker_mask = self.bitboards[6 - offset];
return threat_mask & attacker_mask != 0;
}
pub fn get_safe_king_squares(&self) -> u64 {
let offset: usize = 6 * (1 - self.side_to_move as usize);
let king_sq = self.bitboards[11 - offset].trailing_zeros() as usize;
let bishop_mask = KING_SAFETY_BISHOP_MASK[king_sq];
let rook_mask = KING_SAFETY_ROOK_MASK[king_sq];
let mut attack_map: u64 = 0u64;
let mut board: u64 = self.bitboards[offset];
if self.side_to_move() == 0 {
attack_map |= (board >> 9 & !Self::H_FILE) | (board >> 7 & !Self::A_FILE);
}
else {
attack_map |= (board << 9 & !Self::A_FILE) | (board << 7 & !Self::H_FILE);
}
board = self.bitboards[offset + 1];
while board != 0 {
let piece_sq: u32 = board.trailing_zeros();
board &= !(1 << piece_sq);
attack_map |= self.get_pseudo_knight_moves(piece_sq);
}
board = self.bitboards[offset + 2] & bishop_mask;
while board != 0 {
let piece_sq: u32 = board.trailing_zeros();
board &= !(1 << piece_sq);
attack_map |= self.get_pseudo_bishop_moves_ignore_king(piece_sq);
}
board = self.bitboards[offset + 3] & rook_mask;
while board != 0 {
let piece_sq: u32 = board.trailing_zeros();
board &= !(1 << piece_sq);
attack_map |= self.get_pseudo_rook_moves_ignore_king(piece_sq);
}
board = self.bitboards[offset + 4] & (bishop_mask | rook_mask);
while board != 0 {
let piece_sq: u32 = board.trailing_zeros();
board &= !(1 << piece_sq);
attack_map |= self.get_pseudo_rook_moves_ignore_king(piece_sq) | self.get_pseudo_bishop_moves_ignore_king(piece_sq);
}
board = self.bitboards[offset + 5];
let piece_sq: u32 = board.trailing_zeros();
attack_map |= self.get_pseudo_king_moves(piece_sq);
return !attack_map;
}
} }
#[inline(always)] #[inline(always)]

View File

@@ -0,0 +1,77 @@
use super::utils::*;
#[derive(Copy, Clone, PartialEq, Eq)]
pub struct BitMove {
move_type: BitMoveType,
from_square: u8,
to_square: u8,
promotion_piece: Option<u8>
}
impl BitMove {
#[inline]
pub fn quiet(from: u8, to: u8, promotion_piece: Option<u8>) -> Self {
return Self {
move_type: BitMoveType::Quiet,
from_square: from,
to_square: to,
promotion_piece: promotion_piece
};
}
#[inline]
pub fn capture(from: u8, to: u8, promotion_piece: Option<u8>) -> Self {
return Self {
move_type: BitMoveType::Capture,
from_square: from,
to_square: to,
promotion_piece: promotion_piece
};
}
#[inline]
pub fn castle(from: u8, to: u8) -> Self {
return Self {
move_type: BitMoveType::Castle,
from_square: from,
to_square: to,
promotion_piece: None
};
}
#[inline(always)]
pub fn move_type(&self) -> BitMoveType {
return self.move_type;
}
#[inline(always)]
pub fn from_square(&self) -> u8 {
return self.from_square;
}
#[inline(always)]
pub fn to_square(&self) -> u8 {
return self.to_square;
}
#[inline(always)]
pub fn promotion_piece(&self) -> Option<u8> {
return self.promotion_piece;
}
pub fn uci_notation(&self) -> String {
let mut notation = notation_from_square_number(self.from_square());
notation.push_str(&notation_from_square_number(self.to_square()));
if let Some(promotion_piece) = self.promotion_piece {
notation.push(get_character_by_piece_id(promotion_piece).to_ascii_lowercase());
}
return notation;
}
}
#[derive(Copy, Clone, PartialEq, Eq)]
pub enum BitMoveType {
Quiet,
Capture,
Castle,
EnPassant
}

View File

@@ -64,7 +64,7 @@ impl Board {
for (i, c) in coming_up.chars().enumerate() { for (i, c) in coming_up.chars().enumerate() {
if pieces.contains(&c) { if pieces.contains(&c) {
// board.place_piece(row*8 + col, c); board.place_piece(row*8 + col, c);
col += 1; col += 1;
} }
else if ('1'..='8').contains(&c) { else if ('1'..='8').contains(&c) {
@@ -179,4 +179,21 @@ impl Board {
} }
} }
pub fn place_piece(&mut self, sq: i32, piece: char) {
match piece {
'p' => {self.bitboards[6] |= 1 << sq}
'n' => {self.bitboards[7] |= 1 << sq}
'b' => {self.bitboards[8] |= 1 << sq}
'r' => {self.bitboards[9] |= 1 << sq}
'q' => {self.bitboards[10] |= 1 << sq}
'k' => {self.bitboards[11] |= 1 << sq}
'P' => {self.bitboards[0] |= 1 << sq}
'N' => {self.bitboards[1] |= 1 << sq}
'B' => {self.bitboards[2] |= 1 << sq}
'R' => {self.bitboards[3] |= 1 << sq}
'Q' => {self.bitboards[4] |= 1 << sq}
'K' => {self.bitboards[5] |= 1 << sq}
_ => ()
}
}
} }

View File

@@ -1,8 +1,56 @@
use super::board::Board; use super::board::Board;
use super::attackmaps::RAY_TABLE; use super::attackmaps::RAY_TABLE;
use super::checkinfo::CheckInfo;
use super::attacks::get_raycast_from_square_in_direction;
impl Board { impl Board {
pub fn check_test(&self) -> CheckInfo {
let mut check_info: CheckInfo = CheckInfo::new();
let offset: usize = 6 * self.side_to_move as usize;
let king: u64 = self.bitboards[5 + offset];
let king_sq = king.trailing_zeros() as usize;
let occupancy = self.occupancy[2];
// queen-rook checks (+)
let attacker_mask = self.bitboards[10 - offset] | self.bitboards[9 - offset];
for dir in [0, 2, 4, 6] {
let threat_mask: u64 = get_raycast_from_square_in_direction(occupancy, king_sq, dir);
if threat_mask & attacker_mask != 0 {
check_info.add_checker(threat_mask);
}
}
// queen-bishop checks (x)
let attacker_mask = self.bitboards[10 - offset] | self.bitboards[8 - offset];
for dir in [1, 3, 5, 7] {
let threat_mask = get_raycast_from_square_in_direction(occupancy, king_sq, dir);
if threat_mask & attacker_mask != 0 {
check_info.add_checker(threat_mask);
}
}
// knight checks (L)
let attacker_mask = self.bitboards[7 - offset];
let threat_mask = self.get_pseudo_knight_moves(king_sq as u32);
let checker = threat_mask & attacker_mask;
if checker != 0 {
check_info.add_checker(checker);
}
// pawn checks (v)
let attacker_mask = self.bitboards[6 - offset];
let threat_mask = self.get_pseudo_pawn_captures(king_sq as u32);
let checker = threat_mask & attacker_mask;
if checker != 0 {
check_info.add_checker(checker);
}
return check_info;
}
pub(in super) fn calc_pinned_squares(&mut self) { pub(in super) fn calc_pinned_squares(&mut self) {
self.pinned_squares = [4; 64]; self.pinned_squares = [4; 64];
self.pin_mask = 0u64; self.pin_mask = 0u64;
@@ -45,4 +93,42 @@ impl Board {
} }
} }
#[inline]
pub(in super) fn get_pin_masked_moves(&self, moves: u64, sq: u32) -> u64 {
let sq: usize = sq as usize;
if self.pinned_squares[sq] == 4 { return moves; }
let dir: u8 = self.pinned_squares[sq];
return moves & (RAY_TABLE[sq][dir as usize] | RAY_TABLE[sq][4 + dir as usize]);
}
}
// <----- TESTS ----->
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn check_test_test() {
let fens = [
"rnb1k1nr/pppppppp/4q3/8/1b6/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1", // no check
"rnb1k1nr/pppppppp/4q3/8/1b1P4/8/PPP1PPPP/RNBQKBNR w KQkq d3 0 1", // single check
"rnb1k1nr/ppp1p2p/3pq1p1/8/1b1P1P2/8/PPP2PPP/RNBQKBNR w KQkq - 0 1" // double check
];
let expected_results = [
CheckInfo { check_count: 0, move_mask: 0xFFFF_FFFF_FFFF_FFFF },
CheckInfo { check_count: 1, move_mask: 0x0000_0000_0204_0800 },
CheckInfo { check_count: 2, move_mask: 0x0000_0000_0000_0000 }
];
for test_nr in 0..3 {
let fen = fens[test_nr];
let board = Board::build(fen);
let check_test_actual = board.check_test();
assert_eq!(check_test_actual.check_count, expected_results[test_nr].check_count);
assert_eq!(check_test_actual.move_mask, expected_results[test_nr].move_mask);
}
}
} }

View File

@@ -0,0 +1,44 @@
use super::bitmove::BitMove;
pub struct MoveBuffer {
buffer: [BitMove; 256],
count: usize
}
impl MoveBuffer {
pub fn new() -> Self {
return Self {
buffer: [BitMove::quiet(0, 0, None); 256],
count: 0
};
}
#[inline]
pub fn add(&mut self, bitmove: BitMove) {
self.buffer[self.count] = bitmove;
self.count += 1;
}
#[inline]
pub fn append(&mut self, other: &MoveBuffer) {
self.buffer[self.count..self.count + other.count()].copy_from_slice(other.contents());
self.count += other.count();
}
#[inline(always)]
pub fn clear(&mut self) {
self.count = 0;
}
#[inline(always)]
pub fn count(&self) -> usize{
return self.count;
}
#[inline(always)]
pub fn get(&self, idx: usize) -> &BitMove {
return &self.buffer[idx];
}
#[inline(always)]
pub fn contents(&self) -> &[BitMove] {
return &self.buffer[0..self.count];
}
}

View File

@@ -0,0 +1,67 @@
mod pawns;
mod knights;
mod bishops;
mod rooks;
mod queens;
mod kings;
use super::board::Board;
use super::movebuffer::MoveBuffer;
use super::bitmove::BitMove;
use super::checkinfo::CheckInfo;
use super::utils::*;
impl Board {
const NO_FILTER: u64 = 0xFFFF_FFFF_FFFF_FFFF;
pub fn collect_moves(&mut self, buffer: &mut MoveBuffer, temp_buffer: &mut MoveBuffer) -> bool {
buffer.clear();
self.calc_pinned_squares();
let check_info = self.check_test();
match check_info.check_count {
0 => self.collect_all_moves(buffer, temp_buffer),
1 => self.collect_moves_single_check(buffer, temp_buffer, &check_info),
2 => self.collect_king_evasion(buffer, temp_buffer),
_ => panic!("More than 2 checking pieces found as the same time!")
}
return check_info.check_count > 0;
}
pub(in super) fn collect_all_moves(&self, buffer: &mut MoveBuffer, temp_buffer: &mut MoveBuffer) {
let safe_squares = self.get_safe_king_squares();
self.add_pawn_moves(buffer, temp_buffer, Self::NO_FILTER);
self.add_knight_moves(buffer, temp_buffer, Self::NO_FILTER);
self.add_bishop_moves(buffer, temp_buffer, Self::NO_FILTER);
self.add_rook_moves(buffer, temp_buffer, Self::NO_FILTER);
self.add_queen_moves(buffer, temp_buffer, Self::NO_FILTER);
self.add_king_moves(buffer, temp_buffer, safe_squares);
self.add_king_castles(buffer, safe_squares);
buffer.append(temp_buffer);
temp_buffer.clear();
}
pub(in super) fn collect_moves_single_check(&self, buffer: &mut MoveBuffer, temp_buffer: &mut MoveBuffer, check_info: &CheckInfo) {
let safe_squares = self.get_safe_king_squares();
self.add_pawn_moves(buffer, temp_buffer, check_info.move_mask);
self.add_knight_moves(buffer, temp_buffer, check_info.move_mask);
self.add_bishop_moves(buffer, temp_buffer, check_info.move_mask);
self.add_rook_moves(buffer, temp_buffer, check_info.move_mask);
self.add_queen_moves(buffer, temp_buffer, check_info.move_mask);
self.add_king_moves(buffer, temp_buffer, safe_squares);
buffer.append(temp_buffer);
temp_buffer.clear();
}
pub(in super) fn collect_king_evasion(&self, buffer: &mut MoveBuffer, temp_buffer: &mut MoveBuffer) {
let safe_squares = self.get_safe_king_squares();
self.add_king_moves(buffer, temp_buffer, safe_squares);
buffer.append(&temp_buffer);
temp_buffer.clear();
}
}

View File

@@ -0,0 +1,55 @@
use super::*;
impl Board {
pub fn add_bishop_moves(&self, capture_buffer: &mut MoveBuffer, quiet_buffer: &mut MoveBuffer, move_mask: u64) {
let piece_index = 2 + self.side_to_move * 6;
let mut bishops = self.bitboards[piece_index as usize];
let empty = !self.occupancy[2];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while bishops != 0 {
let from_sq = pop_lsb(&mut bishops);
let raw_move_map = self.get_pseudo_bishop_moves(from_sq) & move_mask;
let move_map = self.get_pin_masked_moves(raw_move_map, from_sq);
let mut quiet_map = move_map & empty;
let mut capture_map = move_map & opponents;
while quiet_map != 0 {
let to_sq = pop_lsb(&mut quiet_map);
quiet_buffer.add(BitMove::quiet(
from_sq as u8,
to_sq as u8,
None
));
}
while capture_map != 0 {
let to_sq = pop_lsb(&mut capture_map);
capture_buffer.add(BitMove::capture(
from_sq as u8,
to_sq as u8,
None
));
}
}
}
pub fn add_bishop_captures(&self, buffer: &mut MoveBuffer, move_mask: u64) {
let offset = 6 * self.side_to_move as usize;
let mut bishops: u64 = self.bitboards[2 + offset];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while bishops != 0 {
let next_sq: u32 = pop_lsb(&mut bishops);
let mut attacks: u64 = self.get_pseudo_bishop_moves(next_sq) & opponents & move_mask;
attacks = self.get_pin_masked_moves(attacks, next_sq);
while attacks != 0 {
let to_sq = pop_lsb(&mut attacks);
buffer.add(BitMove::capture(
next_sq as u8,
to_sq as u8,
None
));
}
}
}
}

View File

@@ -0,0 +1,88 @@
use super::*;
impl Board {
pub fn add_king_moves(&self, capture_buffer: &mut MoveBuffer, quiet_buffer: &mut MoveBuffer, move_mask: u64) {
let piece_index = 5 + self.side_to_move * 6;
let mut kings = self.bitboards[piece_index as usize];
let empty = !self.occupancy[2];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while kings != 0 {
let from_sq = pop_lsb(&mut kings);
let move_map = self.get_pseudo_king_moves(from_sq) & move_mask;
let mut quiet_map = move_map & empty;
let mut capture_map = move_map & opponents;
while quiet_map != 0 {
let to_sq = pop_lsb(&mut quiet_map);
quiet_buffer.add(BitMove::quiet(
from_sq as u8,
to_sq as u8,
None
));
}
while capture_map != 0 {
let to_sq = pop_lsb(&mut capture_map);
capture_buffer.add(BitMove::capture(
from_sq as u8,
to_sq as u8,
None
));
}
}
}
pub fn add_king_captures(&self, buffer: &mut MoveBuffer, move_mask: u64) {
let offset = 6 * self.side_to_move as usize;
let mut kings: u64 = self.bitboards[5 + offset];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while kings != 0 {
let next_sq: u32 = pop_lsb(&mut kings);
let mut attacks: u64 = self.get_pseudo_king_moves(next_sq) & opponents & move_mask;
attacks = self.get_pin_masked_moves(attacks, next_sq);
while attacks != 0 {
let to_sq = pop_lsb(&mut attacks);
buffer.add(BitMove::capture(
next_sq as u8,
to_sq as u8,
None
));
}
}
}
pub fn add_king_castles(&self, buffer: &mut MoveBuffer, move_mask: u64) {
if self.castling_rights & (0b11 << (2 - 2 * self.side_to_move)) == 0 {
return;
}
let offset = 5 + 6 * self.side_to_move as u8;
let castle_offset = 2 - 2 * self.side_to_move as u8;
let castling_rights = self.castling_rights & 3 << castle_offset;
let occupied = self.occupancy[2];
let king_sq = self.bitboards[offset as usize].trailing_zeros();
let queenside_mask = 0b111 << (king_sq - 3);
let kingside_mask = 0b11 << (king_sq + 1);
if (castling_rights & 1 << castle_offset) != 0
&& queenside_mask & occupied == 0
&& !move_mask & 0b11 << (king_sq - 2) == 0
&& !self.is_square_attacked(king_sq - 2) {
buffer.add(BitMove::castle(
king_sq as u8,
(king_sq - 2) as u8
));
}
if (castling_rights & 2 << castle_offset) != 0
&& kingside_mask & occupied == 0
&& !move_mask & 0b11 << (king_sq + 1) == 0
&& !self.is_square_attacked(king_sq + 2) {
buffer.add(BitMove::castle(
king_sq as u8,
(king_sq + 2) as u8
));
}
}
}

View File

@@ -0,0 +1,55 @@
use super::*;
impl Board {
pub fn add_knight_moves(&self, capture_buffer: &mut MoveBuffer, quiet_buffer: &mut MoveBuffer, move_mask: u64) {
let piece_index = 1 + self.side_to_move * 6;
let mut knights = self.bitboards[piece_index as usize];
let empty = !self.occupancy[2];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while knights != 0 {
let from_sq = pop_lsb(&mut knights);
let raw_move_map = self.get_pseudo_knight_moves(from_sq) & move_mask;
let move_map = self.get_pin_masked_moves(raw_move_map, from_sq);
let mut quiet_map = move_map & empty;
let mut capture_map = move_map & opponents;
while quiet_map != 0 {
let to_sq = pop_lsb(&mut quiet_map);
quiet_buffer.add(BitMove::quiet(
from_sq as u8,
to_sq as u8,
None
));
}
while capture_map != 0 {
let to_sq = pop_lsb(&mut capture_map);
capture_buffer.add(BitMove::capture(
from_sq as u8,
to_sq as u8,
None
));
}
}
}
pub fn add_knight_captures(&self, buffer: &mut MoveBuffer, move_mask: u64) {
let offset = 6 * self.side_to_move as usize;
let mut knights: u64 = self.bitboards[1 + offset];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while knights != 0 {
let next_sq: u32 = pop_lsb(&mut knights);
let mut attacks: u64 = self.get_pseudo_knight_moves(next_sq) & opponents & move_mask;
attacks = self.get_pin_masked_moves(attacks, next_sq);
while attacks != 0 {
let to_sq = pop_lsb(&mut attacks);
buffer.add(BitMove::capture(
next_sq as u8,
to_sq as u8,
None
));
}
}
}
}

View File

@@ -0,0 +1,76 @@
use super::*;
impl Board {
pub fn add_pawn_quiets(&self, buffer: &mut MoveBuffer, move_mask: u64) {
let offset: u8 = self.side_to_move * 6;
let mut pawns: u64 = self.bitboards[offset as usize];
while pawns != 0 {
let next_sq = pop_lsb(&mut pawns);
let mut quiets: u64 = self.get_pseudo_pawn_moves(next_sq) & move_mask;
quiets = self.get_pin_masked_moves(quiets, next_sq);
while quiets != 0 {
let to_sq = quiets.trailing_zeros();
if (self.side_to_move == 0 && quiets.trailing_zeros() / 8 == 7)
|| (self.side_to_move == 1 && quiets.trailing_zeros() / 8 == 0) {
for piece_type in [4, 3, 2, 1] {
buffer.add(BitMove::quiet(
next_sq as u8,
to_sq as u8,
Some(piece_type)
));
}
}
else {
buffer.add(BitMove::quiet(
next_sq as u8,
to_sq as u8,
None
));
}
quiets &= !(1 << to_sq);
}
}
}
pub fn add_pawn_captures(&self, buffer: &mut MoveBuffer, move_mask: u64) {
let offset = 6 * self.side_to_move as usize;
let mut pawns: u64 = self.bitboards[offset];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while pawns != 0 {
let next_sq = pop_lsb(&mut pawns);
let mut attacks: u64 = self.get_pseudo_pawn_captures(next_sq) & move_mask;
attacks = self.get_pin_masked_moves(attacks, next_sq);
attacks &= opponents;
while attacks != 0 {
let to_sq = attacks.trailing_zeros();
if (self.side_to_move == 0 && attacks.trailing_zeros() / 8 == 7)
|| (self.side_to_move == 1 && attacks.trailing_zeros() / 8 == 0) {
for piece_type in [4, 3, 2, 1] {
buffer.add(BitMove::capture(
next_sq as u8,
to_sq as u8,
Some(piece_type)
));
}
}
else {
buffer.add(BitMove::capture(
next_sq as u8,
to_sq as u8,
None
));
}
attacks &= !(1 << to_sq);
}
}
}
pub fn add_pawn_moves(&self, capture_buffer: &mut MoveBuffer, quiet_buffer: &mut MoveBuffer, move_mask: u64) {
self.add_pawn_captures(capture_buffer, move_mask);
self.add_pawn_quiets(quiet_buffer, move_mask);
}
}

View File

@@ -0,0 +1,55 @@
use super::*;
impl Board {
pub fn add_queen_moves(&self, capture_buffer: &mut MoveBuffer, quiet_buffer: &mut MoveBuffer, move_mask: u64) {
let piece_index = 4 + self.side_to_move * 6;
let mut queens = self.bitboards[piece_index as usize];
let empty = !self.occupancy[2];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while queens != 0 {
let from_sq = pop_lsb(&mut queens);
let raw_move_map = self.get_pseudo_queen_moves(from_sq) & move_mask;
let move_map = self.get_pin_masked_moves(raw_move_map, from_sq);
let mut quiet_map = move_map & empty;
let mut capture_map = move_map & opponents;
while quiet_map != 0 {
let to_sq = pop_lsb(&mut quiet_map);
quiet_buffer.add(BitMove::quiet(
from_sq as u8,
to_sq as u8,
None
));
}
while capture_map != 0 {
let to_sq = pop_lsb(&mut capture_map);
capture_buffer.add(BitMove::capture(
from_sq as u8,
to_sq as u8,
None
));
}
}
}
pub fn add_queen_captures(&self, buffer: &mut MoveBuffer, move_mask: u64) {
let offset = 6 * self.side_to_move as usize;
let mut queens: u64 = self.bitboards[4 + offset];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while queens != 0 {
let next_sq: u32 = pop_lsb(&mut queens);
let mut attacks: u64 = self.get_pseudo_queen_moves(next_sq) & opponents & move_mask;
attacks = self.get_pin_masked_moves(attacks, next_sq);
while attacks != 0 {
let to_sq = pop_lsb(&mut attacks);
buffer.add(BitMove::capture(
next_sq as u8,
to_sq as u8,
None
));
}
}
}
}

View File

@@ -0,0 +1,55 @@
use super::*;
impl Board {
pub fn add_rook_moves(&self, capture_buffer: &mut MoveBuffer, quiet_buffer: &mut MoveBuffer, move_mask: u64) {
let piece_index = 3 + self.side_to_move * 6;
let mut rooks = self.bitboards[piece_index as usize];
let empty = !self.occupancy[2];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while rooks != 0 {
let from_sq = pop_lsb(&mut rooks);
let raw_move_map = self.get_pseudo_rook_moves(from_sq) & move_mask;
let move_map = self.get_pin_masked_moves(raw_move_map, from_sq);
let mut quiet_map = move_map & empty;
let mut capture_map = move_map & opponents;
while quiet_map != 0 {
let to_sq = pop_lsb(&mut quiet_map);
quiet_buffer.add(BitMove::quiet(
from_sq as u8,
to_sq as u8,
None
));
}
while capture_map != 0 {
let to_sq = pop_lsb(&mut capture_map);
capture_buffer.add(BitMove::capture(
from_sq as u8,
to_sq as u8,
None
));
}
}
}
pub fn add_rook_captures(&self, buffer: &mut MoveBuffer, move_mask: u64) {
let offset = 6 * self.side_to_move as usize;
let mut rooks: u64 = self.bitboards[3 + offset];
let opponents = self.occupancy[1 - self.side_to_move as usize];
while rooks != 0 {
let next_sq: u32 = pop_lsb(&mut rooks);
let mut attacks: u64 = self.get_pseudo_rook_moves(next_sq) & opponents & move_mask;
attacks = self.get_pin_masked_moves(attacks, next_sq);
while attacks != 0 {
let to_sq = pop_lsb(&mut attacks);
buffer.add(BitMove::capture(
next_sq as u8,
to_sq as u8,
None
));
}
}
}
}

View File

@@ -1,13 +1,13 @@
#[inline(always)] #[inline(always)]
pub fn pop_lsb(value: &mut u64) -> usize { pub fn pop_lsb(value: &mut u64) -> u32 {
let idx = value.trailing_zeros() as usize; let idx = value.trailing_zeros();
*value &= !(1 << idx); *value &= !(1 << idx);
return idx; return idx;
} }
#[inline(always)] #[inline(always)]
pub fn pop_msb(value: &mut u64) -> usize { pub fn pop_msb(value: &mut u64) -> u32 {
let idx = 63 - value.leading_zeros() as usize; let idx = 63 - value.leading_zeros();
*value &= !(1 << idx); *value &= !(1 << idx);
return idx; return idx;
} }
@@ -48,6 +48,11 @@ pub fn try_get_square_number_from_notation(notation: &str) -> Result<u8, ()> {
} }
} }
const PIECE_CHARACTERS: [char; 12] = ['P', 'N', 'B', 'R', 'Q', 'K', 'p', 'n', 'b', 'r', 'q', 'k'];
pub fn get_character_by_piece_id(id: u8) -> char {
return PIECE_CHARACTERS[id as usize];
}
// <----- TESTS -----> // <----- TESTS ----->
@@ -67,7 +72,7 @@ mod tests {
0xBEAC_DBE0_903A_AC00, 0xBEAC_DBE0_903A_AC00,
0x01E8_C895_A6F0_0000 0x01E8_C895_A6F0_0000
]; ];
let expected_values: [usize; 6] = [63, 0, 4, 2, 10, 20]; let expected_values: [u32; 6] = [63, 0, 4, 2, 10, 20];
// tests // tests
for index in 0..6 { for index in 0..6 {
@@ -87,7 +92,7 @@ mod tests {
0x0000_C1C3_201C_0DB1, 0x0000_C1C3_201C_0DB1,
0x0000_0203_0DE4_E944 0x0000_0203_0DE4_E944
]; ];
let expected_values: [usize; 6] = [63, 0, 61, 57, 47, 41]; let expected_values: [u32; 6] = [63, 0, 61, 57, 47, 41];
// tests // tests
for index in 0..6 { for index in 0..6 {

31
engine/src/boardsquare.rs Normal file
View File

@@ -0,0 +1,31 @@
use serde::{Deserialize, Serialize};
#[derive(Serialize, Deserialize)]
pub struct BoardSquare {
pub x: usize,
pub y: usize,
}
impl BoardSquare {
pub fn new() -> Self {
return Self { x: 0, y: 0 };
}
pub fn from_coord(x: usize, y: usize) -> Self {
#[cfg(debug_assertions)]
{
if x > 7 {
println!(
"Warning: x coordinate of square is bigger than 7, it might not be on the board!"
);
}
if y > 7 {
println!(
"Warning: y coordinate of square is bigger than 7, it might not be on the board!"
);
}
}
return Self { x: x, y: y };
}
}

71
engine/src/chessmove.rs Normal file
View File

@@ -0,0 +1,71 @@
use crate::piecetype;
use super::boardsquare::BoardSquare;
use super::movetype::MoveType;
use super::piecetype::PieceType;
use serde::{Deserialize, Serialize};
#[derive(Serialize, Deserialize)]
pub struct ChessMove {
pub move_type: MoveType,
pub piece_type: PieceType,
pub from_square: BoardSquare,
pub to_square: BoardSquare,
pub rook_from: BoardSquare,
pub rook_to: BoardSquare,
pub promotion_piece: Option<PieceType>,
}
impl ChessMove {
pub fn quiet(
piece_type: PieceType,
from_square: BoardSquare,
to_square: BoardSquare,
promotion_piece: Option<PieceType>,
) -> Self {
return Self {
move_type: MoveType::Quiet,
piece_type: piece_type,
from_square: from_square,
to_square: to_square,
rook_from: BoardSquare::new(),
rook_to: BoardSquare::new(),
promotion_piece: promotion_piece,
};
}
pub fn capture(
piece_type: PieceType,
from_square: BoardSquare,
to_square: BoardSquare,
promotion_piece: Option<PieceType>,
) -> Self {
return Self {
move_type: MoveType::Capture,
piece_type: piece_type,
from_square: from_square,
to_square: to_square,
rook_from: BoardSquare::new(),
rook_to: BoardSquare::new(),
promotion_piece: promotion_piece,
};
}
pub fn castle(
piece_type: PieceType,
from_square: BoardSquare,
to_square: BoardSquare,
rook_from: BoardSquare,
rook_to: BoardSquare,
) -> Self {
return Self {
move_type: MoveType::Quiet,
piece_type: piece_type,
from_square: from_square,
to_square: to_square,
rook_from: rook_from,
rook_to: rook_to,
promotion_piece: None,
};
}
}

6
engine/src/gameend.rs Normal file
View File

@@ -0,0 +1,6 @@
pub enum GameEnd {
WhiteWon(String),
BlackWon(String),
Draw(String)
}

24
engine/src/lib.rs Normal file
View File

@@ -0,0 +1,24 @@
mod bitboard;
pub mod chessmove;
pub mod piecetype;
pub mod boardsquare;
pub mod movetype;
pub mod gameend;
use chessmove::ChessMove;
use gameend::GameEnd;
pub fn get_available_moves(fen: &str) -> Vec<ChessMove> {
println!("get_available_moves answered");
return vec![];
}
pub fn is_game_over(fen: &str) -> Option<GameEnd> {
println!("is_game_over answered");
return None;
}
pub fn get_board_after_move(fen: &str, chess_move: &ChessMove) -> String {
println!("get_board_after_move answered");
return String::from("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1");
}

11
engine/src/movetype.rs Normal file
View File

@@ -0,0 +1,11 @@
use serde::Deserialize;
use serde::Serialize;
#[derive(Serialize, Deserialize)]
pub enum MoveType {
Quiet,
Capture,
Castle,
EnPassant,
}

18
engine/src/piecetype.rs Normal file
View File

@@ -0,0 +1,18 @@
use serde::{Deserialize, Serialize};
#[derive(Serialize, Deserialize)]
pub enum PieceType {
WhitePawn,
WhiteKnight,
WhiteBishop,
WhiteRook,
WhiteQueen,
WhiteKing,
BlackPawn,
BlackKnight,
BlackBishop,
BlackRook,
BlackQueen,
BlackKing,
}

View File

@@ -14,3 +14,9 @@ url = "2.5.7"
uuid = {version = "1.18.1", features = ["v4", "serde"] } uuid = {version = "1.18.1", features = ["v4", "serde"] }
anyhow = "1.0.100" anyhow = "1.0.100"
rand = "0.9.2" rand = "0.9.2"
engine = {path = "../engine/"}
[[bin]]
name = "client"
path = "src/bin/client.rs"

195
server/src/bin/client.rs Normal file
View File

@@ -0,0 +1,195 @@
use futures_util::{SinkExt, StreamExt};
use serde::{Deserialize, Serialize};
use std::io::{self, Write};
use tokio_tungstenite::{connect_async, tungstenite::Message};
use url::Url;
#[derive(Serialize, Deserialize, Debug)]
#[serde(tag = "type")]
enum ClientMessage {
Join { username: String },
FindMatch,
Move { from: String, to: String },
Resign,
Chat { text: String },
}
#[derive(Serialize, Deserialize, Debug)]
struct ServerMessage {
#[serde(rename = "type")]
message_type: String,
player_id: Option<String>,
match_id: Option<String>,
opponent: Option<String>,
color: Option<String>,
reason: Option<String>,
}
#[tokio::main]
async fn main() -> Result<(), Box<dyn std::error::Error>> {
println!("Knightly Chess Client");
println!("========================");
// Get server address from user
print!("Enter server address [ws://127.0.0.1:9001]: ");
io::stdout().flush()?;
let mut server_addr = String::new();
io::stdin().read_line(&mut server_addr)?;
let server_addr = server_addr.trim();
let server_addr = if server_addr.is_empty() {
"ws://127.0.0.1:9001".to_string()
} else {
server_addr.to_string()
};
// Connect to server
println!("Connecting to {}...", server_addr);
let url = Url::parse(&server_addr)?;
let (ws_stream, _) = connect_async(url).await?;
println!("Connected to server!");
let (mut write, mut read) = ws_stream.split();
// Spawn a task to handle incoming messages
let read_handle = tokio::spawn(async move {
while let Some(message) = read.next().await {
match message {
Ok(msg) => {
if msg.is_text() {
let text = msg.to_text().unwrap();
println!("\nServer: {}", text);
// Try to parse as structured message
if let Ok(parsed) = serde_json::from_str::<ServerMessage>(text) {
match parsed.message_type.as_str() {
"welcome" => {
if let Some(player_id) = parsed.player_id {
println!("Welcome! Your player ID: {}", player_id);
}
}
_ => {
println!("cucc: {:?}", parsed);
}
}
}
}
}
Err(e) => {
eprintln!("Error receiving message: {}", e);
break;
}
}
}
});
// Main loop for sending messages
println!("\nAvailable commands:");
println!(" join <username> - Join the server");
println!(" findmatch - Find a match");
println!(" move <from> <to> - Make a move (e.g., move e2 e4)");
println!(" chat <message> - Send chat message");
println!(" resign - Resign from current game");
println!(" quit - Exit client");
println!();
loop {
print!("➡️ Enter command: ");
io::stdout().flush()?;
let mut input = String::new();
io::stdin().read_line(&mut input)?;
let input = input.trim();
if input.is_empty() {
continue;
}
let parts: Vec<&str> = input.split_whitespace().collect();
let command = parts[0].to_lowercase();
match command.as_str() {
"quit" | "exit" => {
println!("👋 Goodbye!");
break;
}
"join" => {
if parts.len() >= 2 {
let username = parts[1..].join(" ");
let message = ClientMessage::Join { username };
send_message(&mut write, &message).await?;
} else {
println!("Usage: join <username>");
}
}
"findmatch" | "find" => {
let message = ClientMessage::FindMatch;
send_message(&mut write, &message).await?;
println!("🔍 Searching for a match...");
}
"move" => {
if parts.len() >= 3 {
let from = parts[1].to_string();
let to = parts[2].to_string();
let message = ClientMessage::Move { from, to };
send_message(&mut write, &message).await?;
println!("♟️ Sent move: {} -> {}", parts[1], parts[2]);
} else {
println!("Usage: move <from> <to> (e.g., move e2 e4)");
}
}
"chat" => {
if parts.len() >= 2 {
let text = parts[1..].join(" ");
let message = ClientMessage::Chat { text };
send_message(&mut write, &message).await?;
} else {
println!("Usage: chat <message>");
}
}
"resign" => {
let message = ClientMessage::Resign;
send_message(&mut write, &message).await?;
println!("Resigned from current game");
}
"help" => {
print_help();
}
_ => {
println!(
"Unknown command: {}. Type 'help' for available commands.",
command
);
}
}
}
// Cleanup
read_handle.abort();
Ok(())
}
async fn send_message(
write: &mut futures_util::stream::SplitSink<
tokio_tungstenite::WebSocketStream<
tokio_tungstenite::MaybeTlsStream<tokio::net::TcpStream>,
>,
Message,
>,
message: &ClientMessage,
) -> Result<(), Box<dyn std::error::Error>> {
let json = serde_json::to_string(message)?;
write.send(Message::Text(json)).await?;
Ok(())
}
fn print_help() {
println!("\n📖 Available Commands:");
println!(" join <username> - Register with a username");
println!(" findmatch - Enter matchmaking queue");
println!(" move <from> <to> - Make a chess move");
println!(" chat <message> - Send chat to opponent");
println!(" resign - Resign from current game");
println!(" help - Show this help");
println!(" quit - Exit the client");
println!();
}

View File

@@ -1,3 +1,5 @@
use crate::connection::ClientEvent::*;
use engine::get_available_moves;
use futures_util::{SinkExt, StreamExt}; use futures_util::{SinkExt, StreamExt};
use serde::{Deserialize, Serialize}; use serde::{Deserialize, Serialize};
use std::collections::{HashMap, VecDeque}; use std::collections::{HashMap, VecDeque};
@@ -26,6 +28,28 @@ pub fn new_waiting_queue() -> WaitingQueue {
Arc::new(Mutex::new(VecDeque::new())) Arc::new(Mutex::new(VecDeque::new()))
} }
#[derive(Serialize, Deserialize, Debug)]
pub struct Step {
pub from: String,
pub to: String,
}
#[derive(Serialize, Deserialize, Debug)]
#[serde(tag = "type")]
enum ClientEvent {
Join { username: String },
FindMatch,
Move { from: String, to: String },
Resign,
Chat { text: String },
RequestLegalMoves { fen: String },
}
#[derive(Serialize, Deserialize, Debug)]
pub struct EventResponse {
pub response: Result<(), String>,
}
#[derive(Debug)] #[derive(Debug)]
pub struct PlayerConnection { pub struct PlayerConnection {
pub id: Uuid, pub id: Uuid,
@@ -43,12 +67,6 @@ pub struct GameMatch {
pub move_history: Vec<String>, pub move_history: Vec<String>,
} }
#[derive(Serialize, Deserialize, Debug)]
pub struct Step {
pub from: String,
pub to: String,
}
// Message sending utilities // Message sending utilities
pub async fn send_message_to_player( pub async fn send_message_to_player(
connections: &ConnectionMap, connections: &ConnectionMap,
@@ -102,7 +120,6 @@ pub async fn handle_connection(
connections: ConnectionMap, connections: ConnectionMap,
matches: MatchMap, matches: MatchMap,
waiting_queue: WaitingQueue, waiting_queue: WaitingQueue,
event_system: crate::events::EventSystem,
) -> anyhow::Result<()> { ) -> anyhow::Result<()> {
use tokio_tungstenite::accept_async; use tokio_tungstenite::accept_async;
@@ -141,8 +158,52 @@ pub async fn handle_connection(
let text = message.to_text()?; let text = message.to_text()?;
println!("Received from {}: {}", player_id, text); println!("Received from {}: {}", player_id, text);
// TODO: Parse and handle message with event system let client_data: ClientEvent = serde_json::from_str(text)
// This will be implemented when we integrate the event system .expect("Failed to convert data into json at handle_connection");
println!("client: {:?}", client_data);
match client_data {
Join { username } => {
{
let mut conn_map = connections.lock().await;
let player = conn_map.get_mut(&player_id).unwrap();
player.username = Some(username);
}
//respone to client
let response: EventResponse = EventResponse {
response: core::result::Result::Ok(()),
};
println!("response: {:?}", response);
let _ = send_message_to_player(
&connections,
player_id,
&serde_json::to_string(&response).unwrap(),
)
.await;
}
FindMatch => {
let mut wait_queue = waiting_queue.lock().await;
wait_queue.push_back(player_id.clone());
println!("Appended {} to the waiting queue", player_id);
println!("queue {:?}", wait_queue);
}
Move { from, to } => {}
RequestLegalMoves { fen } => {
let moves = get_available_moves(&fen);
let _ = send_message_to_player(
&connections,
player_id,
&serde_json::to_string(&moves).unwrap(),
)
.await;
println!("Sent moves to player: {}", player_id);
}
_ => {}
}
} }
} }

View File

@@ -1,126 +0,0 @@
use serde::{Deserialize, Serialize};
use std::sync::Arc;
use tokio::sync::Mutex;
use tokio::sync::mpsc;
use uuid::Uuid;
#[derive(Serialize, Deserialize, Debug)]
pub struct Step {
pub from: String,
pub to: String,
}
#[derive(Serialize, Deserialize, Debug)]
#[serde(tag = "type")]
pub enum ClientEvent {
Join { username: String },
FindMatch,
Move { from: String, to: String },
Resign,
Chat { text: String },
RequestLegalMoves { fen: String },
}
#[derive(Debug)]
pub enum ServerEvent {
PlayerJoined(Uuid, String),
PlayerLeft(Uuid),
PlayerJoinedQueue(Uuid),
PlayerJoinedMatch(Uuid, Uuid), // player_id, match_id
PlayerMove(Uuid, Step),
PlayerResigned(Uuid),
MatchCreated(Uuid, Uuid, Uuid), // match_id, white_id, black_id
}
pub struct EventSystem {
sender: mpsc::UnboundedSender<(Uuid, ClientEvent)>,
receiver: Arc<Mutex<mpsc::UnboundedReceiver<(Uuid, ClientEvent)>>>,
}
impl Clone for EventSystem {
fn clone(&self) -> Self {
Self {
sender: self.sender.clone(),
receiver: Arc::clone(&self.receiver),
}
}
}
impl EventSystem {
pub fn new() -> Self {
let (sender, receiver) = mpsc::unbounded_channel();
Self {
sender,
receiver: Arc::new(Mutex::new(receiver)),
}
}
pub async fn send_event(
&self,
player_id: Uuid,
event: ClientEvent,
) -> Result<(), Box<dyn std::error::Error>> {
self.sender.send((player_id, event))?;
Ok(())
}
pub async fn next_event(&self) -> Option<(Uuid, ClientEvent)> {
let mut receiver = self.receiver.lock().await;
receiver.recv().await
}
}
impl Default for EventSystem {
fn default() -> Self {
Self::new()
}
}
#[cfg(test)]
mod tests {
use super::*;
use uuid::Uuid;
#[tokio::test]
async fn test_event_system_send_and_receive() {
let event_system = EventSystem::new();
let player_id = Uuid::new_v4();
let join_event = ClientEvent::Join {
username: "test_user".to_string(),
};
let send_result = event_system.send_event(player_id, join_event).await;
assert!(send_result.is_ok(), "Should send event successfully");
let received = event_system.next_event().await;
assert!(received.is_some(), "Should receive sent event");
let (received_id, received_event) = received.unwrap();
assert_eq!(received_id, player_id, "Should receive correct player ID");
match received_event {
ClientEvent::Join { username } => {
assert_eq!(username, "test_user", "Should receive correct username");
}
_ => panic!("Should receive Join event"),
}
}
#[tokio::test]
async fn test_event_system_clone() {
let event_system1 = EventSystem::new();
let event_system2 = event_system1.clone();
let player_id = Uuid::new_v4();
let event = ClientEvent::FindMatch;
event_system1.send_event(player_id, event).await.unwrap();
let received = event_system2.next_event().await;
assert!(
received.is_some(),
"Cloned event system should receive events"
);
}
}

View File

@@ -1,6 +1,6 @@
mod connection; mod connection;
mod events;
mod matchmaking; mod matchmaking;
mod messages;
use tokio::net::TcpListener; use tokio::net::TcpListener;
#[tokio::main] #[tokio::main]
@@ -14,15 +14,11 @@ async fn main() -> anyhow::Result<()> {
let matches = connection::new_match_map(); let matches = connection::new_match_map();
let waiting_queue = connection::new_waiting_queue(); let waiting_queue = connection::new_waiting_queue();
// Event system for communication between components
let event_system = events::EventSystem::new();
// Start matchmaking background task // Start matchmaking background task
let matchmaker = matchmaking::MatchmakingSystem::new( let matchmaker = matchmaking::MatchmakingSystem::new(
connections.clone(), connections.clone(),
matches.clone(), matches.clone(),
waiting_queue.clone(), waiting_queue.clone(),
event_system.clone(),
); );
tokio::spawn(async move { tokio::spawn(async move {
matchmaker.run().await; matchmaker.run().await;
@@ -33,17 +29,10 @@ async fn main() -> anyhow::Result<()> {
let connections = connections.clone(); let connections = connections.clone();
let matches = matches.clone(); let matches = matches.clone();
let waiting_queue = waiting_queue.clone(); let waiting_queue = waiting_queue.clone();
let event_system = event_system.clone();
tokio::spawn(async move { tokio::spawn(async move {
if let Err(e) = connection::handle_connection( if let Err(e) =
stream, connection::handle_connection(stream, connections, matches, waiting_queue).await
connections,
matches,
waiting_queue,
event_system,
)
.await
{ {
eprintln!("Connection error: {}", e); eprintln!("Connection error: {}", e);
} }

View File

@@ -1,5 +1,4 @@
use crate::connection::{ConnectionMap, GameMatch, MatchMap, WaitingQueue}; use crate::connection::{ConnectionMap, GameMatch, MatchMap, WaitingQueue};
use crate::events::EventSystem;
use rand::random; use rand::random;
use uuid::Uuid; use uuid::Uuid;
@@ -7,21 +6,14 @@ pub struct MatchmakingSystem {
connections: ConnectionMap, connections: ConnectionMap,
matches: MatchMap, matches: MatchMap,
waiting_queue: WaitingQueue, waiting_queue: WaitingQueue,
event_system: EventSystem,
} }
impl MatchmakingSystem { impl MatchmakingSystem {
pub fn new( pub fn new(connections: ConnectionMap, matches: MatchMap, waiting_queue: WaitingQueue) -> Self {
connections: ConnectionMap,
matches: MatchMap,
waiting_queue: WaitingQueue,
event_system: EventSystem,
) -> Self {
Self { Self {
connections, connections,
matches, matches,
waiting_queue, waiting_queue,
event_system,
} }
} }
@@ -114,7 +106,6 @@ impl MatchmakingSystem {
#[cfg(test)] #[cfg(test)]
mod tests { mod tests {
use super::*; use super::*;
use crate::events::EventSystem;
use uuid::Uuid; use uuid::Uuid;
use crate::connection::new_connection_map; use crate::connection::new_connection_map;
@@ -126,14 +117,9 @@ mod tests {
let connections = new_connection_map(); let connections = new_connection_map();
let matches = new_match_map(); let matches = new_match_map();
let waiting_queue = new_waiting_queue(); let waiting_queue = new_waiting_queue();
let event_system = EventSystem::new();
let matchmaking = MatchmakingSystem::new( let matchmaking =
connections.clone(), MatchmakingSystem::new(connections.clone(), matches.clone(), waiting_queue.clone());
matches.clone(),
waiting_queue.clone(),
event_system.clone(),
);
let player1 = Uuid::new_v4(); let player1 = Uuid::new_v4();
let player2 = Uuid::new_v4(); let player2 = Uuid::new_v4();
@@ -172,14 +158,9 @@ mod tests {
let connections = new_connection_map(); let connections = new_connection_map();
let matches = new_match_map(); let matches = new_match_map();
let waiting_queue = new_waiting_queue(); let waiting_queue = new_waiting_queue();
let event_system = EventSystem::new();
let matchmaking = MatchmakingSystem::new( let matchmaking =
connections.clone(), MatchmakingSystem::new(connections.clone(), matches.clone(), waiting_queue.clone());
matches.clone(),
waiting_queue.clone(),
event_system.clone(),
);
let player1 = Uuid::new_v4(); let player1 = Uuid::new_v4();
{ {

View File

@@ -3,7 +3,7 @@ use eframe::egui;
fn main() -> eframe::Result<()> { fn main() -> eframe::Result<()> {
let options = eframe::NativeOptions{ let options = eframe::NativeOptions{
viewport: egui::ViewportBuilder::default() viewport: egui::ViewportBuilder::default()
.with_fullscreen(false) .with_fullscreen(true)
.with_min_inner_size(egui::vec2(800.0, 600.0)) // Minimum width, height .with_min_inner_size(egui::vec2(800.0, 600.0)) // Minimum width, height
.with_inner_size(egui::vec2(7680.0, 4320.0)), // Initial size .with_inner_size(egui::vec2(7680.0, 4320.0)), // Initial size
..Default::default() ..Default::default()
@@ -101,6 +101,7 @@ impl Default for ChessApp {
(1920, 1080), (1920, 1080),
(2560, 1440), (2560, 1440),
(3840, 2160), (3840, 2160),
(7680, 4320),
], ],
selected_resolution: 2, // Default to 1920x1080 selected_resolution: 2, // Default to 1920x1080
state: AppState::MainMenu, state: AppState::MainMenu,
@@ -427,4 +428,4 @@ mod tests {
let app = ChessApp::default(); let app = ChessApp::default();
assert_eq!(app.server_port, "8080"); assert_eq!(app.server_port, "8080");
} }
} }