Custom Chess Sudoku 3

Click cell and type number as Solution/to add to Candidates, or twice to delete.
Delete/Backspace/button X to clear cell.
Numbers can not repeat in Row, Column, Box and you can customize below.

customFunc=(grid,r,c,val,vals)=>{

let [vacant,king,bishop,knight,wpawn,spawn,epawn,npawn,rook,queen]=[0,8,6,7,1,2,3,4,5,9]
let moves = [-1,0,1]
if(val==king){
	for(let i of moves){
		for(let j of moves){
			let nr = +r+i
			let nc = +c+j
			if((nr==r && nc==c) || nr<0 || nc<0 || nr>=width || nc>=width || grid[nr][nc]==vacant) continue
			if(grid[nr][nc]==val) return false 
		}
	}
}
if(val==bishop||val==queen){
	moves=[-1,1]
	for(let i of moves){
		for(let j of moves){
			for(let f=0; f<width; f++){
				let nr = +r+f*i
				let nc = +c+f*j
				if((nr==r && nc==c) || nr<0 || nc<0 || nr>=width || nc>=width) continue
				if(grid[nr][nc]==val) return false
			}
		}
	}
}
if(val==knight){
	moves = [[-1,-2],[-1,2],[1,-2],[1,2],[-2,-1],[-2,1],[2,-1],[2,1]]
	for(let [i,j] of moves){
		let nr = +r+i
		let nc = +c+j
		if((nr==r && nc==c) || nr<0 || nc<0 || nr>=width || nc>=width || grid[nr][nc]==vacant) continue
		if(grid[nr][nc]==val) return false 
	}
}
//west facing pawn
if(val==wpawn){
	moves=[-1,1]
	for(let i of moves){
		for(let j of [-1]){
			let nr = +r+i
			let nc = +c+j
			if((nr==r && nc==c) || nr<0 || nc<0 || nr>=width || nc>=width || grid[nr][nc]==vacant) continue
			if(grid[nr][nc]==val) return false 
		}
	}
}
//east facing pawn
if(val==epawn){
	moves=[-1,1]
	for(let i of moves){
		for(let j of [1]){
			let nr = +r+i
			let nc = +c+j
			if((nr==r && nc==c) || nr<0 || nc<0 || nr>=width || nc>=width || grid[nr][nc]==vacant) continue
			if(grid[nr][nc]==val) return false 
		}
	}
}
//south facing pawn (black)
if(val==spawn){//king not within king's reach
	moves=[-1,1]
	for(let i of [1]){
		for(let j of moves){
			let nr = +r+i
			let nc = +c+j
			if((nr==r && nc==c) || nr<0 || nc<0 || nr>=width || nc>=width || grid[nr][nc]==vacant) continue
			if(grid[nr][nc]==val) return false 
		}
	}
}
//north facing pawn (white)
if(val==npawn){//king not within king's reach
	moves=[-1,1]
	for(let i of [-1]){
		for(let j of moves){
			let nr = +r+i
			let nc = +c+j
			if((nr==r && nc==c) || nr<0 || nc<0 || nr>=width || nc>=width || grid[nr][nc]==vacant) continue
			if(grid[nr][nc]==val) return false 
		}
	}
}
return true

} Note: subtle differences with Solver version

customDisplay=(grid,r,c,val,vals)=>{

}